203392026-01-06 15:16:50Samiko4321Zenehallgatáspython3Time limit exceeded 15/50301ms18200 KiB
N,K = map(int,input().split())
T = list(map(int,input().split()))
P = list(map(int,input().split()))

osszido = sum(T)

for i in range(1,N):
    T[i] += T[i-1]

for p in P:
    p = p % osszido
    eleje = 0
    vege = N-1
    for _ in range(20):
        kozepe = (eleje + vege) // 2
        if T[kozepe] < p:
            eleje = kozepe
        else:
            vege = kozepe
    print(vege+1, end=" ")
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/016ms3324 KiB
2Time limit exceeded0/0277ms18172 KiB
3Accepted2/224ms3124 KiB
4Accepted2/223ms3100 KiB
5Accepted2/223ms3084 KiB
6Accepted3/325ms3124 KiB
7Accepted3/323ms3148 KiB
8Accepted3/325ms3240 KiB
9Time limit exceeded0/2300ms17876 KiB
10Time limit exceeded0/2300ms17936 KiB
11Time limit exceeded0/2301ms18200 KiB
12Time limit exceeded0/2282ms17596 KiB
13Time limit exceeded0/2282ms17296 KiB
14Time limit exceeded0/2282ms17244 KiB
15Time limit exceeded0/2300ms16224 KiB
16Time limit exceeded0/2277ms15472 KiB
17Time limit exceeded0/2284ms15744 KiB
18Time limit exceeded0/2284ms14928 KiB
19Time limit exceeded0/2300ms15004 KiB
20Time limit exceeded0/2275ms15036 KiB
21Time limit exceeded0/2280ms15048 KiB
22Time limit exceeded0/3282ms15032 KiB
23Time limit exceeded0/3300ms15072 KiB
24Time limit exceeded0/3282ms15056 KiB