oj.uz

Submission #633070

# Submission time Handle Problem Language Result Execution time Memory
633070 2022-08-21T14:20:46 Z karolb2011 Potatoes and fertilizers (LMIO19_bulves) Python 3
0 / 100
 1000 ms 22836 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:
            ww+=c
            t+=c-1
        else:
            ww-=c
            t-=c-1
        z.append(ww-t)
    print(min(ww,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)

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2900 KB Output is correct
2 Correct 25 ms 3052 KB Output is correct
3 Correct 27 ms 3000 KB Output is correct
4 Correct 104 ms 4908 KB Output is correct
5 Correct 201 ms 6976 KB Output is correct
6 Correct 475 ms 12928 KB Output is correct
7 Execution timed out 1014 ms 22836 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2900 KB Output is correct
2 Correct 25 ms 3052 KB Output is correct
3 Correct 27 ms 3000 KB Output is correct
4 Correct 104 ms 4908 KB Output is correct
5 Correct 201 ms 6976 KB Output is correct
6 Correct 475 ms 12928 KB Output is correct
7 Execution timed out 1014 ms 22836 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2900 KB Output is correct
2 Correct 25 ms 3052 KB Output is correct
3 Correct 18 ms 2900 KB Output is correct
4 Correct 17 ms 2992 KB Output is correct
5 Correct 19 ms 2988 KB Output is correct
6 Correct 24 ms 3104 KB Output is correct
7 Correct 21 ms 3012 KB Output is correct
8 Correct 28 ms 3104 KB Output is correct
9 Correct 21 ms 3156 KB Output is correct
10 Incorrect 20 ms 3028 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2900 KB Output is correct
2 Correct 25 ms 3052 KB Output is correct
3 Correct 27 ms 3000 KB Output is correct
4 Correct 18 ms 2900 KB Output is correct
5 Correct 17 ms 2992 KB Output is correct
6 Correct 19 ms 2988 KB Output is correct
7 Correct 24 ms 3104 KB Output is correct
8 Correct 21 ms 3012 KB Output is correct
9 Correct 28 ms 3104 KB Output is correct
10 Correct 21 ms 3156 KB Output is correct
11 Incorrect 20 ms 3028 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2900 KB Output is correct
2 Correct 25 ms 3052 KB Output is correct
3 Correct 27 ms 3000 KB Output is correct
4 Correct 18 ms 2900 KB Output is correct
5 Correct 17 ms 2992 KB Output is correct
6 Correct 19 ms 2988 KB Output is correct
7 Correct 24 ms 3104 KB Output is correct
8 Correct 21 ms 3012 KB Output is correct
9 Correct 28 ms 3104 KB Output is correct
10 Correct 21 ms 3156 KB Output is correct
11 Correct 104 ms 4908 KB Output is correct
12 Correct 201 ms 6976 KB Output is correct
13 Correct 475 ms 12928 KB Output is correct
14 Execution timed out 1014 ms 22836 KB Time limit exceeded
15 Halted 0 ms 0 KB -