/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 34ms 17.188 MiB
#2 Wrong Answer 43ms 18.137 MiB
#3 Wrong Answer 46ms 18.262 MiB

Code

for _ in range(int(input())):
    n = int(input())
    a = tuple(map(int, input().split()))
    c = tuple(map(int, input().split()))
    ans = []
    l = False
    for i in range(n - 1):
        n_ans = [a[i]]
        s = a[i] + a[i + 1]
        while s < c[i + 1]:
            if ans:
                s += ans[-1][-1]
                n_ans.append(ans[-1][-1])
                del ans[-1][-1]
                if not ans[-1]:
                    del ans[-1]
            else:
                l = True
                break
        else:
            ans.append(n_ans)
        if l:
            print('-1')
            break
    else:
        print(len(ans))

Information

Submit By
Type
Submission
Problem
P1199 F. Roy and Path Game
Contest
Happy New Year 2026
Language
PyPy 3 (Python 3.9.18 PyPy 7.3.15)
Submit At
2026-01-06 17:03:30
Judged At
2026-01-06 17:03:30
Judged By
Score
0
Total Time
46ms
Peak Memory
18.262 MiB