# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633081 | karolb2011 | Potatoes and fertilizers (LMIO19_bulves) | Pypy 3 | 580 ms | 53204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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)
ww=min(t,min(z)+t)
else:
w=[]
for c in s:
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |