Submission #4033392


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=sum+c

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

print(min(count,count2))

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 10
WA × 8
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 287 ms 18428 KB
00-01.txt AC 151 ms 12468 KB
00-02.txt AC 153 ms 12468 KB
01-00.txt AC 1291 ms 20156 KB
01-01.txt WA 1674 ms 20392 KB
01-02.txt WA 1267 ms 19916 KB
01-03.txt WA 1154 ms 19552 KB
01-04.txt WA 1475 ms 19244 KB
01-05.txt WA 1311 ms 18524 KB
01-06.txt AC 1241 ms 19840 KB
01-07.txt AC 1112 ms 19028 KB
01-08.txt AC 1259 ms 20168 KB
01-09.txt WA 1451 ms 21016 KB
01-10.txt AC 1007 ms 17896 KB
01-11.txt AC 1288 ms 19960 KB
01-12.txt WA 1614 ms 20172 KB
01-13.txt WA 1141 ms 19244 KB
01-14.txt AC 1277 ms 20164 KB