Submission #4033400


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 594 Byte
Status WA
Exec Time 1695 ms
Memory 21300 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 148 ms 12468 KB
00-01.txt AC 147 ms 12468 KB
00-02.txt AC 147 ms 12468 KB
01-00.txt AC 1285 ms 20156 KB
01-01.txt WA 1695 ms 21300 KB
01-02.txt AC 1264 ms 19904 KB
01-03.txt AC 1194 ms 19484 KB
01-04.txt WA 1583 ms 19204 KB
01-05.txt WA 1346 ms 18476 KB
01-06.txt AC 1242 ms 19840 KB
01-07.txt AC 1194 ms 20272 KB
01-08.txt AC 1304 ms 20120 KB
01-09.txt WA 1459 ms 19200 KB
01-10.txt AC 962 ms 17896 KB
01-11.txt AC 1234 ms 19900 KB
01-12.txt WA 1574 ms 20164 KB
01-13.txt AC 1149 ms 19200 KB
01-14.txt AC 1293 ms 20168 KB