Submission #633065

# Submission time Handle Problem Language Result Execution time Memory
633065 2022-08-21T14:15:26 Z karolb2011 Potatoes and fertilizers (LMIO19_bulves) Python 3
24 / 100
833 ms 26792 KB
import sys
import heapq as hq
input = sys.stdin.readline
n=int(input())
t=0
p=0
s=[]
ww=0
z=[]
for i in range(n):
    pi,bi=list(map(int,input().split()))
    p+=pi-bi
    s.append(p)
if p==0:
    for c in s:
        ww+=abs(c)
elif p==1:
    for c in s:
        if c>=1:
            w+=c
            t+=c-1
        else:
            w-=c
            t-=c-1
        z.append(w-t)
    print(min(t,min(z)+t))
        
else:
    w=[]
    for c in s:
        if c<0:
            ww-=c
            c=0
        elif c>p:
            ww+=c-p
            c=p
        hq.heappush(w,-c)
        if w[0]<-c:
            hq.heappush(w,-c)
            ww+=abs(-hq.heappop(w)-c)
print(ww)
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2892 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 20 ms 3060 KB Output is correct
4 Correct 99 ms 4944 KB Output is correct
5 Correct 180 ms 6944 KB Output is correct
6 Correct 401 ms 12948 KB Output is correct
7 Correct 833 ms 22964 KB Output is correct
8 Correct 814 ms 26792 KB Output is correct
9 Correct 819 ms 22808 KB Output is correct
10 Correct 829 ms 13688 KB Output is correct
11 Correct 782 ms 16340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2892 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 20 ms 3060 KB Output is correct
4 Correct 99 ms 4944 KB Output is correct
5 Correct 180 ms 6944 KB Output is correct
6 Correct 401 ms 12948 KB Output is correct
7 Correct 833 ms 22964 KB Output is correct
8 Correct 814 ms 26792 KB Output is correct
9 Correct 819 ms 22808 KB Output is correct
10 Correct 829 ms 13688 KB Output is correct
11 Correct 782 ms 16340 KB Output is correct
12 Runtime error 179 ms 8028 KB Execution failed because the return code was nonzero
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2892 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 13 ms 2880 KB Output is correct
4 Correct 15 ms 2900 KB Output is correct
5 Correct 17 ms 3052 KB Output is correct
6 Correct 27 ms 3132 KB Output is correct
7 Correct 21 ms 3028 KB Output is correct
8 Correct 22 ms 3028 KB Output is correct
9 Correct 18 ms 3156 KB Output is correct
10 Runtime error 17 ms 2896 KB Execution failed because the return code was nonzero
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2892 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 20 ms 3060 KB Output is correct
4 Correct 13 ms 2880 KB Output is correct
5 Correct 15 ms 2900 KB Output is correct
6 Correct 17 ms 3052 KB Output is correct
7 Correct 27 ms 3132 KB Output is correct
8 Correct 21 ms 3028 KB Output is correct
9 Correct 22 ms 3028 KB Output is correct
10 Correct 18 ms 3156 KB Output is correct
11 Runtime error 17 ms 2896 KB Execution failed because the return code was nonzero
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2892 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 20 ms 3060 KB Output is correct
4 Correct 13 ms 2880 KB Output is correct
5 Correct 15 ms 2900 KB Output is correct
6 Correct 17 ms 3052 KB Output is correct
7 Correct 27 ms 3132 KB Output is correct
8 Correct 21 ms 3028 KB Output is correct
9 Correct 22 ms 3028 KB Output is correct
10 Correct 18 ms 3156 KB Output is correct
11 Correct 99 ms 4944 KB Output is correct
12 Correct 180 ms 6944 KB Output is correct
13 Correct 401 ms 12948 KB Output is correct
14 Correct 833 ms 22964 KB Output is correct
15 Correct 814 ms 26792 KB Output is correct
16 Correct 819 ms 22808 KB Output is correct
17 Correct 829 ms 13688 KB Output is correct
18 Correct 782 ms 16340 KB Output is correct
19 Runtime error 179 ms 8028 KB Execution failed because the return code was nonzero
20 Halted 0 ms 0 KB -