Submission #4033412


Source Code Expand

from operator import itemgetter
import numpy as np

N = int(input())
sum=0
sum2=0
count=0
count2=0


s = input().split()

for i in range(N):
    c = int(s[i])
    if i==0:
        sum=c
        count2=abs(c)+1
        sum2=np.sign(c)*(-1)
    else:
        if sum*(sum+c)>=0:
            count += abs(sum+c)+1
            sum = -1 * np.sign(sum)
        else:
            sum+=c

        if sum2 * (sum2 + c) >= 0:
            count2 += abs(sum2 + c) + 1
            sum2 = -1 * np.sign(sum2)
        else:
            sum2+=c

print(min(count,count2))

Submission Info

Submission Time
Task C - Sequence
User kakkey1964
Language Python (3.4.3)
Score 0
Code Size 585 Byte
Status WA
Exec Time 1592 ms
Memory 20268 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 13
WA × 5
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 152 ms 12468 KB
00-01.txt AC 152 ms 12468 KB
00-02.txt AC 152 ms 12468 KB
01-00.txt AC 1240 ms 20108 KB
01-01.txt WA 1592 ms 20268 KB
01-02.txt AC 1248 ms 19904 KB
01-03.txt AC 1320 ms 19496 KB
01-04.txt WA 1540 ms 19196 KB
01-05.txt WA 1370 ms 18524 KB
01-06.txt AC 1258 ms 19836 KB
01-07.txt AC 1078 ms 19108 KB
01-08.txt AC 1273 ms 20108 KB
01-09.txt WA 1406 ms 19204 KB
01-10.txt AC 981 ms 19216 KB
01-11.txt AC 1222 ms 19904 KB
01-12.txt WA 1579 ms 20168 KB
01-13.txt AC 1160 ms 19248 KB
01-14.txt AC 1291 ms 20168 KB