답안 #633075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633075	2022-08-21T14:45:24 Z	karolb2011	Potatoes and fertilizers (LMIO19_bulves)	Python 3	24 / 100	1000 ms	26788 KB

bulves

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+=bi-pi
    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)
        ww=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)

Subtask #1

24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	2900 KB	Output is correct
2	Correct	17 ms	2900 KB	Output is correct
3	Correct	17 ms	3092 KB	Output is correct
4	Correct	93 ms	4932 KB	Output is correct
5	Correct	166 ms	6888 KB	Output is correct
6	Correct	384 ms	12924 KB	Output is correct
7	Correct	830 ms	22856 KB	Output is correct
8	Correct	768 ms	26788 KB	Output is correct
9	Correct	764 ms	22968 KB	Output is correct
10	Correct	687 ms	13708 KB	Output is correct
11	Correct	783 ms	16424 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	2900 KB	Output is correct
2	Correct	17 ms	2900 KB	Output is correct
3	Correct	17 ms	3092 KB	Output is correct
4	Correct	93 ms	4932 KB	Output is correct
5	Correct	166 ms	6888 KB	Output is correct
6	Correct	384 ms	12924 KB	Output is correct
7	Correct	830 ms	22856 KB	Output is correct
8	Correct	768 ms	26788 KB	Output is correct
9	Correct	764 ms	22968 KB	Output is correct
10	Correct	687 ms	13708 KB	Output is correct
11	Correct	783 ms	16424 KB	Output is correct
12	Execution timed out	1085 ms	8388 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	2900 KB	Output is correct
2	Correct	17 ms	2900 KB	Output is correct
3	Correct	13 ms	2900 KB	Output is correct
4	Correct	17 ms	2900 KB	Output is correct
5	Correct	18 ms	2920 KB	Output is correct
6	Correct	20 ms	2988 KB	Output is correct
7	Correct	18 ms	3028 KB	Output is correct
8	Correct	20 ms	3040 KB	Output is correct
9	Correct	19 ms	3072 KB	Output is correct
10	Incorrect	92 ms	2996 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	2900 KB	Output is correct
2	Correct	17 ms	2900 KB	Output is correct
3	Correct	17 ms	3092 KB	Output is correct
4	Correct	13 ms	2900 KB	Output is correct
5	Correct	17 ms	2900 KB	Output is correct
6	Correct	18 ms	2920 KB	Output is correct
7	Correct	20 ms	2988 KB	Output is correct
8	Correct	18 ms	3028 KB	Output is correct
9	Correct	20 ms	3040 KB	Output is correct
10	Correct	19 ms	3072 KB	Output is correct
11	Incorrect	92 ms	2996 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	2900 KB	Output is correct
2	Correct	17 ms	2900 KB	Output is correct
3	Correct	17 ms	3092 KB	Output is correct
4	Correct	13 ms	2900 KB	Output is correct
5	Correct	17 ms	2900 KB	Output is correct
6	Correct	18 ms	2920 KB	Output is correct
7	Correct	20 ms	2988 KB	Output is correct
8	Correct	18 ms	3028 KB	Output is correct
9	Correct	20 ms	3040 KB	Output is correct
10	Correct	19 ms	3072 KB	Output is correct
11	Correct	93 ms	4932 KB	Output is correct
12	Correct	166 ms	6888 KB	Output is correct
13	Correct	384 ms	12924 KB	Output is correct
14	Correct	830 ms	22856 KB	Output is correct
15	Correct	768 ms	26788 KB	Output is correct
16	Correct	764 ms	22968 KB	Output is correct
17	Correct	687 ms	13708 KB	Output is correct
18	Correct	783 ms	16424 KB	Output is correct
19	Execution timed out	1085 ms	8388 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-