Submission #3291702


Source Code Expand

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

typedef struct {
	int i;
	int num;
}pair;

signed compair(const void *a, const void *b){
	return ((pair *)a)->num - ((pair *)b)->num;
}

int max(int a, int b){
	return a >= b ? a : b;
}

int main(){
	int N, i, M = 100000, ans;
	scanf("%d", &N);
	int *v = (int *)malloc(sizeof(int) * N);
	pair *A = (pair *)malloc(sizeof(pair) * (M + 1));
	pair *B = (pair *)malloc(sizeof(pair) * (M + 1));
	for(i = 0; i <= M; i++){
		A[i].num = 0;
		B[i].num = 0;
		A[i].i = i;
		B[i].i = i;
	}
	for(i = 0; i < N; i++){
		scanf("%d", &v[i]);
		if(i % 2 == 0){
			A[v[i]].num++;
		}
		else{
			B[v[i]].num++;
		}
	}
	qsort(A, M + 1, sizeof(pair), compair);
	qsort(B, M + 1, sizeof(pair), compair);
	if(A[M].i != B[M].i){
		ans = A[M].num + B[M].num;
	}
	else{
		ans = A[M].num + max(A[M - 1].num, B[M - 1].num);
	}
	printf("%d\n", N - ans);
	return 0;
}

Submission Info

Submission Time
Task C - /\/\/\/
User abc050
Language C (GCC 5.4.1)
Score 300
Code Size 922 Byte
Status AC
Exec Time 24 ms
Memory 2940 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:19:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ^
./Main.c:30:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v[i]);
   ^

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 21 ms 2940 KB
ababa_1.txt AC 21 ms 2940 KB
eq_0.txt AC 20 ms 2940 KB
eq_1.txt AC 20 ms 2940 KB
rnd_17.txt AC 20 ms 2940 KB
sample1_3132.txt AC 9 ms 2556 KB
sample2_iw.txt AC 9 ms 2556 KB
sample3_1111.txt AC 9 ms 2556 KB
top2_0.txt AC 23 ms 2940 KB
top2_1.txt AC 23 ms 2940 KB
top2_2.txt AC 23 ms 2940 KB
top2_3.txt AC 23 ms 2940 KB
top2modoki_0.txt AC 23 ms 2940 KB
top2modoki_1.txt AC 23 ms 2940 KB
top2modoki_2.txt AC 23 ms 2940 KB
top2modoki_3.txt AC 23 ms 2940 KB
vary_1.txt AC 24 ms 2736 KB
vary_2.txt AC 23 ms 2736 KB
vary_3.txt AC 24 ms 2860 KB
zoro_0.txt AC 9 ms 2172 KB