Submission #3807755

Source Code Expand

n = int(input())
a  = list(map(int, input().split()))
sum = [a[0]]
for i in range(1, n):
	sum.append(sum[i-1]+a[i])
ans = abs(2*sum[0]-sum[n-1])
for i in range(1, n-1):
	ans = min(ans, abs(2*sum[i]-sum[n-1]))
print(ans)

Submission Info

Submission Time
Task C - Splitting Pile
User Ricky_pon
Language Python (3.4.3)
Score 300
Code Size 227 Byte
Status AC
Exec Time 231 ms
Memory 24832 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 2940 KB
00_example_02.txt AC 18 ms 3060 KB
01.txt AC 118 ms 14064 KB
02.txt AC 54 ms 6716 KB
03.txt AC 46 ms 5820 KB
04.txt AC 143 ms 16312 KB
05.txt AC 46 ms 5964 KB
06.txt AC 222 ms 24832 KB
07.txt AC 231 ms 23356 KB
08.txt AC 216 ms 24812 KB
09.txt AC 214 ms 23776 KB
10.txt AC 215 ms 23372 KB
11.txt AC 18 ms 3060 KB
12.txt AC 19 ms 3188 KB
13.txt AC 209 ms 20980 KB
14.txt AC 18 ms 3060 KB