제출 #1091517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091517		vjudge1	Potatoes and fertilizers (LMIO19_bulves)	Cpython 3	24 / 100	1038 ms	53296 KiB

bulves

n = int(input())

a = [0] * n
b = [0] * n

for i in range(n):
    x, y = map(int, input().split())
    a[i] = x
    b[i] = y

# subtask 1 only
ans = 0
extra = 0
suffix = []
for i in range(n):
    ans += abs(extra)
    extra += a[i] - b[i]
    suffix.append(-1 if extra > 0 else 1)

if sum(a) == sum(b) + 1:
    # subtask 2
    current = ans
    suffix.pop()
    total = 0
    while len(suffix) > 0:
        total += suffix.pop()
        ans = min(ans, current + total)

print(ans)

• Subtask 1: 24 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36