Submission #3291461


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

typedef long long int int64;

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))

#define POS(i,j) ((i)*(m+1)+(j))

void run(void){
  const int m=100000;
  int n;
  scanf("%d",&n);
  int *cnt=(int *)calloc(2*(m+1),sizeof(int));
  int i;
  for(i=0;i<n;i++){
    int a;
    scanf("%d",&a);
    cnt[POS(i%2,a)]++;
  }
  int a=0;
  for(i=1;i<=m;i++) if(cnt[POS(0,i)]>cnt[POS(0,a)]) a=i;
  int b=0;
  for(i=1;i<=m;i++) if(cnt[POS(1,i)]>cnt[POS(1,b)]) b=i;
  if(a!=b){
    printf("%d\n",n-cnt[POS(0,a)]-cnt[POS(1,b)]);
    return;
  } else if(cnt[POS(0,a)]==cnt[POS(1,b)]){
    int c=0;
    for(i=1;i<=m;i++) if(i!=a && cnt[POS(0,i)]>cnt[POS(0,c)]) c=i;
    int d=0;
    for(i=1;i<=m;i++) if(i!=b && cnt[POS(1,i)]>cnt[POS(1,d)]) d=i;
    printf("%d\n",cnt[POS(0,c)]>=cnt[POS(1,d)]?n-cnt[POS(0,c)]-cnt[POS(1,b)]:n-cnt[POS(0,a)]-cnt[POS(1,d)]);
    return;
  }
}

int main(void){
  run();
  return 0;
}

Submission Info

Submission Time
Task C - /\/\/\/
User sansen
Language C (GCC 5.4.1)
Score 300
Code Size 1047 Byte
Status AC
Exec Time 12 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘run’:
./Main.c:16:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ^
./Main.c:21:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&a);
     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
Set Name Test Cases
Sample sample1_3132.txt, sample2_iw.txt, sample3_1111.txt
All ababa_0.txt, ababa_1.txt, eq_0.txt, eq_1.txt, rnd_17.txt, sample1_3132.txt, sample2_iw.txt, sample3_1111.txt, top2_0.txt, top2_1.txt, top2_2.txt, top2_3.txt, top2modoki_0.txt, top2modoki_1.txt, top2modoki_2.txt, top2modoki_3.txt, vary_1.txt, vary_2.txt, vary_3.txt, zoro_0.txt
Case Name Status Exec Time Memory
ababa_0.txt AC 12 ms 896 KB
ababa_1.txt AC 12 ms 896 KB
eq_0.txt AC 12 ms 896 KB
eq_1.txt AC 12 ms 896 KB
rnd_17.txt AC 11 ms 896 KB
sample1_3132.txt AC 1 ms 896 KB
sample2_iw.txt AC 1 ms 896 KB
sample3_1111.txt AC 2 ms 896 KB
top2_0.txt AC 11 ms 896 KB
top2_1.txt AC 12 ms 896 KB
top2_2.txt AC 12 ms 896 KB
top2_3.txt AC 12 ms 896 KB
top2modoki_0.txt AC 12 ms 896 KB
top2modoki_1.txt AC 12 ms 896 KB
top2modoki_2.txt AC 11 ms 896 KB
top2modoki_3.txt AC 12 ms 896 KB
vary_1.txt AC 12 ms 896 KB
vary_2.txt AC 12 ms 896 KB
vary_3.txt AC 12 ms 896 KB
zoro_0.txt AC 2 ms 896 KB