Submission #2715054


Source Code Expand

N = int(input())
a = [int(i) for i in input().split()]

snuke = a[0]
total = sum(a)
arai = total - snuke

minimum = abs(snuke- arai)

for i in range(1,N-1):
    snuke = snuke + a[i]
    arai = arai - a[i]
    sub = abs(snuke-arai)
    if sub < minimum:
        minimum = sub

print(minimum)

Submission Info

Submission Time
Task C - Splitting Pile
User carolinaus
Language Python (3.4.3)
Score 300
Code Size 306 Byte
Status AC
Exec Time 166 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 16 ms 3060 KB
00_example_02.txt AC 16 ms 2940 KB
01.txt AC 91 ms 13932 KB
02.txt AC 44 ms 6716 KB
03.txt AC 37 ms 5820 KB
04.txt AC 112 ms 16440 KB
05.txt AC 37 ms 5832 KB
06.txt AC 161 ms 24832 KB
07.txt AC 164 ms 23648 KB
08.txt AC 163 ms 23780 KB
09.txt AC 165 ms 23648 KB
10.txt AC 166 ms 23664 KB
11.txt AC 17 ms 2940 KB
12.txt AC 18 ms 3188 KB
13.txt AC 154 ms 21012 KB
14.txt AC 17 ms 3060 KB