194812025-12-10 21:05:36birozsZenehallgatáspypy3Runtime error 15/5075ms32000 KiB
N,K = map(int,input().split())
T = list(map(int,input().split()))
P = list(map(int,input().split()))
for i in range(1,N):
    T[i] += T[i-1]
for t in P:
    t = t % T[-1]
    k = 1
    while k**2 < N:
        k += 1
    eleje = 0
    vege = N-1
    for _ in range(k):
        if T[(eleje+vege)//2] < t:
            eleje = (eleje+vege)//2
        elif T[(eleje+vege)//2] > t:
            vege = (eleje+vege)//2
        else:
            eleje = (eleje+vege)//2
            break
    if T[eleje] >= t:
        print(eleje + 1,end=" ")
    else:
        print(eleje+2,end=" ")
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/039ms19436 KiB
2Runtime error0/075ms32000 KiB
3Accepted2/267ms22056 KiB
4Accepted2/259ms21984 KiB
5Accepted2/261ms21988 KiB
6Accepted3/359ms21940 KiB
7Accepted3/359ms21940 KiB
8Accepted3/368ms21992 KiB
9Runtime error0/274ms32000 KiB
10Runtime error0/268ms32000 KiB
11Runtime error0/264ms32000 KiB
12Runtime error0/267ms32000 KiB
13Runtime error0/275ms32000 KiB
14Runtime error0/265ms32000 KiB
15Runtime error0/275ms32000 KiB
16Runtime error0/264ms32000 KiB
17Runtime error0/275ms32000 KiB
18Runtime error0/264ms32000 KiB
19Runtime error0/272ms32000 KiB
20Runtime error0/263ms32000 KiB
21Runtime error0/275ms32000 KiB
22Runtime error0/364ms32000 KiB
23Runtime error0/371ms32000 KiB
24Runtime error0/363ms32000 KiB