QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #349372 | #8057. Best Carry Player 4 | teikn# | WA | 623ms | 9948kb | Python3 | 509b | 2024-03-10 01:25:50 | 2024-03-10 01:25:50 |
Judging History
answer
import sys
for _ in range(int(input())):
m=int(input())
a=list(map(int,sys.stdin.readline().strip().split()))
b=list(map(int,sys.stdin.readline().strip().split()))
a[0]=float('inf')
b[0]=float('inf')
mxtot=0
cr=0
nm1=0
for i in range(m):
if min(mxtot,a[i]):
cr=1
mxtot += b[~i]
mv = min(mxtot,a[i])
a[i] -= mv
mxtot -= mv
nm1 += mv
if cr:
print(nm1)
else:
print(nm1-1)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 11ms
memory: 9948kb
input:
5 2 1 2 3 4 3 1 0 1 0 1 0 4 1 0 0 1 1 1 1 1 5 123456 114514 1919810 233333 234567 20050815 998244353 0 0 0 10 5 3 5 3 2 4 2 4 1 5 9 9 8 2 4 4 3 5 3 0
output:
5 1 2 467900 29
result:
ok 5 number(s): "5 1 2 467900 29"
Test #2:
score: -100
Wrong Answer
time: 623ms
memory: 9920kb
input:
100000 5 0 1 1 1 1 0 0 1 0 0 5 0 0 0 0 0 1 1 1 0 0 5 0 0 2 1 1 0 2 1 0 1 5 0 0 0 0 0 1 2 1 0 0 5 0 1 0 1 1 0 0 1 1 1 5 2 0 0 0 1 1 0 0 0 3 5 2 0 0 1 1 0 2 1 1 1 5 0 0 0 0 2 0 0 0 0 1 5 0 0 0 0 0 0 1 1 0 0 5 4 0 0 0 0 0 0 0 1 0 5 0 0 0 0 1 2 1 1 0 0 5 0 2 3 0 0 0 0 0 1 0 5 1 1 1 0 1 1 0 1 0 1 5 0 0 0...
output:
1 -1 4 -1 4 3 3 2 -1 -1 1 0 2 0 3 0 0 -1 -1 0 0 0 4 0 4 1 -1 2 3 2 1 4 0 -1 2 0 0 1 1 -1 0 3 5 3 1 2 1 -1 0 2 2 2 -1 3 0 2 1 1 0 0 -1 4 1 1 2 2 -1 3 3 -1 1 -1 1 -1 0 1 1 2 0 2 4 -1 2 5 -1 1 1 0 0 -1 2 1 3 -1 1 0 4 3 3 0 2 2 1 1 3 0 1 -1 0 -1 1 -1 3 2 2 -1 1 0 1 0 1 -1 0 2 4 1 2 3 2 2 2 -1 1 -1 0 2 3...
result:
wrong answer 1st numbers differ - expected: '2', found: '1'