Submission #1043209

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043209		model_code	Bikeparking (EGOI24_bikeparking)	Pypy 3	100 / 100	125 ms	63568 KiB

Main

#!/usr/bin/env python3

n = int(input())
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]

good, okay, bad, free = 0, 0, 0, 0

for i in range(n):
  k = min(y[i], free)
  free -= k
  y[i] -= k
  good += k

  k = min(y[i], okay)
  okay -= k
  bad += k
  good += k
  y[i] -= k

  k = min(y[i], x[i])
  okay += k
  y[i] -= k
  x[i] -= k

  free += x[i]
  bad += y[i]

print(good - bad)

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 19 / 19
• Subtask 4: 24 / 24
• Subtask 5: 32 / 32