Submission #3453050
Source Code Expand
Scanf.(Array.(let s,q,a,c,f,d=(fun f->Scanf.scanf" %d"f),(fun _->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 0,q 0)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 | 300 |
Code Size | 395 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 10496 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 160 ms | 8960 KB |
ababa_1.txt | AC | 160 ms | 8960 KB |
eq_0.txt | AC | 133 ms | 7680 KB |
eq_1.txt | AC | 134 ms | 7680 KB |
rnd_17.txt | AC | 133 ms | 7808 KB |
sample1_3132.txt | AC | 96 ms | 4096 KB |
sample2_iw.txt | AC | 94 ms | 6016 KB |
sample3_1111.txt | AC | 96 ms | 4096 KB |
top2_0.txt | AC | 151 ms | 8064 KB |
top2_1.txt | AC | 155 ms | 8192 KB |
top2_2.txt | AC | 151 ms | 8064 KB |
top2_3.txt | AC | 154 ms | 8192 KB |
top2modoki_0.txt | AC | 151 ms | 8192 KB |
top2modoki_1.txt | AC | 154 ms | 8192 KB |
top2modoki_2.txt | AC | 151 ms | 8064 KB |
top2modoki_3.txt | AC | 149 ms | 8192 KB |
vary_1.txt | AC | 204 ms | 10496 KB |
vary_2.txt | AC | 203 ms | 10496 KB |
vary_3.txt | AC | 192 ms | 9728 KB |
zoro_0.txt | AC | 96 ms | 5504 KB |