Submission #3453039
Source Code Expand
Scanf.(Array.(let s,q,a,c,f,d=(fun f->Scanf.scanf" %d"f),make 100005(0,0),(fun a i->a.(i)<-fst a.(i)+1,i),(fun u v->compare v u),fst,snd in s@@fun n->let e,o=init n(fun i->s@@fun v->i,v)|>fold_left(fun(e,o)(i,v)->(if i mod 2=0 then a e v else a o v);e,o)(q,q)in sort c e;sort c o;print_int@@n-(if d e.(0)=d o.(0)then max(f e.(0)+f o.(1))(f e.(1)+f o.(0))else(f e.(0)+f o.(0)));0,0))
Submission Info
Submission Time | |
---|---|
Task | C - /\/\/\/ |
User | sk0 |
Language | OCaml (4.02.3) |
Score | 0 |
Code Size | 382 Byte |
Status | WA |
Exec Time | 223 ms |
Memory | 9728 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
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 | 215 ms | 8448 KB |
ababa_1.txt | AC | 223 ms | 8448 KB |
eq_0.txt | WA | 134 ms | 6912 KB |
eq_1.txt | WA | 133 ms | 6912 KB |
rnd_17.txt | WA | 131 ms | 7040 KB |
sample1_3132.txt | AC | 100 ms | 4992 KB |
sample2_iw.txt | AC | 97 ms | 3328 KB |
sample3_1111.txt | WA | 95 ms | 3328 KB |
top2_0.txt | WA | 176 ms | 7296 KB |
top2_1.txt | WA | 170 ms | 7424 KB |
top2_2.txt | WA | 174 ms | 7424 KB |
top2_3.txt | WA | 177 ms | 7424 KB |
top2modoki_0.txt | WA | 173 ms | 7296 KB |
top2modoki_1.txt | WA | 175 ms | 7424 KB |
top2modoki_2.txt | WA | 171 ms | 7424 KB |
top2modoki_3.txt | WA | 169 ms | 7296 KB |
vary_1.txt | AC | 216 ms | 9728 KB |
vary_2.txt | WA | 215 ms | 8448 KB |
vary_3.txt | WA | 208 ms | 8064 KB |
zoro_0.txt | WA | 94 ms | 3328 KB |