Submission #9889493


Source Code Expand

N = int(input())
a = list(map(int,input().split()))
# >0
r = 0
res = 0
for i in range(N):
    sa = 0
    r += a[i]
    if i%2==0:
        if r <= 0:
            sa = 1-r
            r += sa
    else:
        if r >= 0:
            sa = r+1
            r -= sa
    res += sa

# <0
r = 0
res2 = 0
for i in range(N):
    sa = 0
    r += a[i]
    if i%2==1:
        if r <= 0:
            sa = 1-r
            r += sa
    else:
        if r >= 0:
            sa = r+1
            r -= sa
    res2 += sa
print(min(res,res2))

Submission Info

Submission Time
Task C - Sequence
User Loa
Language Python (3.4.3)
Score 300
Code Size 556 Byte
Status AC
Exec Time 148 ms
Memory 14468 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 18
Set Name Test Cases
Sample 00-00.txt, 00-01.txt, 00-02.txt
All 00-00.txt, 00-01.txt, 00-02.txt, 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt
Case Name Status Exec Time Memory
00-00.txt AC 17 ms 3064 KB
00-01.txt AC 17 ms 3064 KB
00-02.txt AC 17 ms 3064 KB
01-00.txt AC 143 ms 14464 KB
01-01.txt AC 136 ms 14468 KB
01-02.txt AC 135 ms 13784 KB
01-03.txt AC 132 ms 13868 KB
01-04.txt AC 129 ms 13140 KB
01-05.txt AC 118 ms 11884 KB
01-06.txt AC 135 ms 13672 KB
01-07.txt AC 123 ms 12552 KB
01-08.txt AC 143 ms 14468 KB
01-09.txt AC 129 ms 13132 KB
01-10.txt AC 106 ms 11068 KB
01-11.txt AC 138 ms 14372 KB
01-12.txt AC 139 ms 14464 KB
01-13.txt AC 134 ms 13264 KB
01-14.txt AC 148 ms 14212 KB