Submission #3443097


Source Code Expand

#include <stdio.h>

typedef struct Number
{
    int value;
    int changes;
} Number;

#define MAX_VALUE 100000

void GetBest(int *count, int total, Number *first, Number *second)
{
    *first = (Number){.value = 1, .changes = total - count[1]};
    *second = (Number){.value = -1, .changes = total + 1};

    for (int i = 2; i <= MAX_VALUE; i += 1) {
        Number new_num = {.value = i, .changes = total - count[i]};
        if (new_num.changes < first->changes) {
            *second = *first;
            *first = new_num;
        } else if (new_num.changes < second->changes) {
            *second = new_num;
        }
    }
}

int Min(int a, int b) { return a < b ? a : b; }

int count[2][MAX_VALUE + 1];

int main()
{
    int n;
    scanf("%d", &n);

    for (int i = 0; i < n; i += 1) {
        int num;
        scanf("%d", &num);
        count[i % 2][num] += 1;
    }

    Number even1, even2;
    GetBest(count[0], (n + 1) / 2, &even1, &even2);

    Number odd1, odd2;
    GetBest(count[1], n / 2, &odd1, &odd2);

    int res = even1.changes + odd1.changes;
    if (even1.value == odd1.value) {
        res = Min(even2.changes + odd1.changes,
                  even1.changes + odd2.changes);
    }

    printf("%d\n", res);
    return 0;
}

Submission Info

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

Compile Error

./Main.c: In function ‘main’:
./Main.c:34:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ^
./Main.c:38:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &num);
         ^

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 11 ms 512 KB
ababa_1.txt AC 11 ms 512 KB
eq_0.txt AC 11 ms 256 KB
eq_1.txt AC 11 ms 256 KB
rnd_17.txt AC 11 ms 256 KB
sample1_3132.txt AC 1 ms 128 KB
sample2_iw.txt AC 1 ms 128 KB
sample3_1111.txt AC 1 ms 128 KB
top2_0.txt AC 11 ms 896 KB
top2_1.txt AC 11 ms 896 KB
top2_2.txt AC 11 ms 896 KB
top2_3.txt AC 11 ms 896 KB
top2modoki_0.txt AC 11 ms 896 KB
top2modoki_1.txt AC 11 ms 896 KB
top2modoki_2.txt AC 11 ms 896 KB
top2modoki_3.txt AC 11 ms 896 KB
vary_1.txt AC 12 ms 896 KB
vary_2.txt AC 12 ms 896 KB
vary_3.txt AC 11 ms 896 KB
zoro_0.txt AC 1 ms 128 KB