Submission #6001141


Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn=100000+10;
int n,a[maxn],u[maxn],v[maxn];
int main(){
    scanf("%d",&n);
    for(int i=0,In;i<n;++i){
        scanf("%d",&In);
        if(i&1)++u[In];
        else ++v[In];
    }
    int mxu=0,mxv=0,secu,secv,idu,idv;
    for(int i=1;i<=100000;++i){
        if(mxu<u[i]){
            secu=mxu;
            mxu=u[i];
            idu=i;
        }
        if(mxv<v[i]){
            secv=mxv;
            mxv=v[i];
            idv=i;
        }
    }
    if(idu==idv){
        int ans=min(n-mxu-secv,n-mxv-secu);
        printf("%d",ans);
    }
    else {
        printf("%d",n-mxu-mxv);
    }
    return 0;
}

Submission Info

Submission Time
Task C - /\/\/\/
User ndqzhang1111
Language C++14 (GCC 5.4.1)
Score 0
Code Size 730 Byte
Status WA
Exec Time 11 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&In);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 14
WA × 6
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 10 ms 512 KB
ababa_1.txt AC 10 ms 512 KB
eq_0.txt WA 10 ms 256 KB
eq_1.txt WA 10 ms 256 KB
rnd_17.txt AC 10 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 10 ms 896 KB
top2_1.txt AC 11 ms 896 KB
top2_2.txt AC 11 ms 896 KB
top2_3.txt WA 11 ms 896 KB
top2modoki_0.txt WA 11 ms 896 KB
top2modoki_1.txt WA 11 ms 896 KB
top2modoki_2.txt AC 10 ms 896 KB
top2modoki_3.txt AC 10 ms 896 KB
vary_1.txt AC 11 ms 896 KB
vary_2.txt WA 10 ms 896 KB
vary_3.txt AC 10 ms 896 KB
zoro_0.txt AC 1 ms 128 KB