Submission #1366304
Source Code Expand
N = input() a = map(int, raw_input().split()) def solve(): if sum(a) % N != 0: return -1 if sum(a) == 0: return 0 v = sum(a) / N num, length = 0, 0 ans = 0 for i in range(N): num += a[i] length += 1 if (num > 0) and (num == v * length): num = 0 length = 0 else: ans += 1 return ans print solve()
Submission Info
Submission Time | |
---|---|
Task | B - 島と橋 |
User | namakemono |
Language | Python (2.7.6) |
Score | 100 |
Code Size | 429 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 2568 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 10 ms | 2568 KB |
sample_02.txt | AC | 10 ms | 2568 KB |
sample_03.txt | AC | 10 ms | 2568 KB |
sample_04.txt | AC | 10 ms | 2568 KB |
subtask1_01.txt | AC | 10 ms | 2568 KB |
subtask1_02.txt | AC | 10 ms | 2568 KB |
subtask1_03.txt | AC | 10 ms | 2568 KB |
subtask1_04.txt | AC | 10 ms | 2568 KB |
subtask1_05.txt | AC | 10 ms | 2568 KB |
subtask1_06.txt | AC | 10 ms | 2568 KB |
subtask1_07.txt | AC | 10 ms | 2568 KB |
subtask1_08.txt | AC | 10 ms | 2568 KB |
subtask1_09.txt | AC | 10 ms | 2568 KB |
subtask1_10.txt | AC | 10 ms | 2568 KB |
subtask1_11.txt | AC | 10 ms | 2568 KB |
subtask1_12.txt | AC | 10 ms | 2568 KB |
subtask1_13.txt | AC | 10 ms | 2568 KB |
subtask1_14.txt | AC | 10 ms | 2568 KB |
subtask1_15.txt | AC | 11 ms | 2568 KB |
subtask1_16.txt | AC | 10 ms | 2568 KB |
subtask1_17.txt | AC | 10 ms | 2568 KB |
subtask1_18.txt | AC | 10 ms | 2568 KB |
subtask1_19.txt | AC | 10 ms | 2568 KB |
subtask1_20.txt | AC | 11 ms | 2568 KB |
subtask1_21.txt | AC | 10 ms | 2568 KB |
subtask1_22.txt | AC | 10 ms | 2568 KB |
subtask1_23.txt | AC | 11 ms | 2568 KB |
subtask1_24.txt | AC | 11 ms | 2568 KB |
subtask1_25.txt | AC | 10 ms | 2568 KB |
subtask1_26.txt | AC | 10 ms | 2568 KB |
subtask1_27.txt | AC | 10 ms | 2568 KB |
subtask1_28.txt | AC | 11 ms | 2568 KB |
subtask1_29.txt | AC | 11 ms | 2568 KB |
subtask1_30.txt | AC | 10 ms | 2568 KB |
subtask1_31.txt | AC | 11 ms | 2568 KB |
subtask1_32.txt | AC | 10 ms | 2568 KB |
subtask1_33.txt | AC | 12 ms | 2568 KB |
subtask1_34.txt | AC | 11 ms | 2568 KB |