Submission #2860763

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
from itertools import accumulate
b = list(accumulate(a))
ans = float("INF")
for i in range(n-1):
  ans = min(ans, abs(b[i]-(b[-1]-b[i])))
print(ans)

Submission Info

Submission Time
Task C - Splitting Pile
User ponponpainful
Language Python (3.4.3)
Score 300
Code Size 208 Byte
Status AC
Exec Time 180 ms
Memory 24940 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 17 ms 3060 KB
00_example_02.txt AC 18 ms 3060 KB
01.txt AC 95 ms 14064 KB
02.txt AC 45 ms 6716 KB
03.txt AC 40 ms 5820 KB
04.txt AC 115 ms 16312 KB
05.txt AC 40 ms 5704 KB
06.txt AC 170 ms 23800 KB
07.txt AC 180 ms 23776 KB
08.txt AC 172 ms 24940 KB
09.txt AC 173 ms 23776 KB
10.txt AC 177 ms 23788 KB
11.txt AC 18 ms 3064 KB
12.txt AC 19 ms 3188 KB
13.txt AC 163 ms 20984 KB
14.txt AC 18 ms 3060 KB