Submission #3768694
Source Code Expand
# coding: utf-8 import collections n=int(input()) v=list(map(int, input().split())) ans=0 c = collections.Counter(v) if len(c) == 1: print(n//2) else: for i in range(0,n-2): if v[i] != v[i+2]: if v[i] != v[i+1]: v[i+2] = v[i] else: v[i] = v[i+2] ans+=1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - /\/\/\/ |
User | yamada3 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 371 Byte |
Status | WA |
Exec Time | 106 ms |
Memory | 19936 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 | 87 ms | 14444 KB |
ababa_1.txt | AC | 87 ms | 13848 KB |
eq_0.txt | AC | 99 ms | 14232 KB |
eq_1.txt | AC | 99 ms | 14232 KB |
rnd_17.txt | AC | 98 ms | 14136 KB |
sample1_3132.txt | AC | 21 ms | 3316 KB |
sample2_iw.txt | AC | 20 ms | 3316 KB |
sample3_1111.txt | AC | 20 ms | 3316 KB |
top2_0.txt | WA | 103 ms | 14232 KB |
top2_1.txt | WA | 93 ms | 14908 KB |
top2_2.txt | WA | 104 ms | 13768 KB |
top2_3.txt | WA | 99 ms | 14364 KB |
top2modoki_0.txt | AC | 96 ms | 14892 KB |
top2modoki_1.txt | WA | 100 ms | 14308 KB |
top2modoki_2.txt | WA | 96 ms | 14236 KB |
top2modoki_3.txt | WA | 94 ms | 14360 KB |
vary_1.txt | AC | 106 ms | 19936 KB |
vary_2.txt | AC | 105 ms | 14136 KB |
vary_3.txt | AC | 102 ms | 14140 KB |
zoro_0.txt | AC | 21 ms | 3316 KB |