245022026-02-12 09:50:05imreerikdaniel08Zenehallgatáscpp17Time limit exceeded 15/50254ms1380 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,K;
int total=0;
vector<int>dalok;

int main(){
    cin>>N>>K;
    dalok.resize(N+1);
    dalok[0]=0;
    for(int i=1;i<=N;i++){
        cin>>dalok[i];
        total+=dalok[i];
        dalok[i]+=dalok[i-1];
    }

    int ido;
    for(int i=1;i<=K;i++){
        cin>>ido;
        ido%=total;
        if(ido==0)cout<<N<<" ";
        else{
            cout<<lower_bound(dalok.begin()+1,dalok.end(),ido)-dalok.begin()<<" ";
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0244ms1332 KiB
3Accepted2/23ms316 KiB
4Accepted2/23ms316 KiB
5Accepted2/23ms388 KiB
6Accepted3/33ms316 KiB
7Accepted3/33ms316 KiB
8Accepted3/33ms316 KiB
9Time limit exceeded0/2254ms1312 KiB
10Time limit exceeded0/2246ms1332 KiB
11Time limit exceeded0/2252ms1140 KiB
12Time limit exceeded0/2245ms1332 KiB
13Time limit exceeded0/2240ms1332 KiB
14Time limit exceeded0/2241ms1332 KiB
15Time limit exceeded0/2247ms1320 KiB
16Time limit exceeded0/2245ms1336 KiB
17Time limit exceeded0/2244ms1332 KiB
18Time limit exceeded0/2250ms1316 KiB
19Time limit exceeded0/2250ms1380 KiB
20Time limit exceeded0/2238ms1332 KiB
21Time limit exceeded0/2238ms1332 KiB
22Time limit exceeded0/3246ms1356 KiB
23Time limit exceeded0/3245ms1144 KiB
24Time limit exceeded0/3216ms1160 KiB