245032026-02-12 09:50:35imreerikdaniel08Zenehallgatáscpp17Accepted 50/5050ms1392 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,K;
int total=0;
vector<int>dalok;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    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
base50/50
1Accepted0/01ms316 KiB
2Accepted0/050ms1336 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms428 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted2/250ms1308 KiB
10Accepted2/250ms1248 KiB
11Accepted2/250ms1340 KiB
12Accepted2/250ms1392 KiB
13Accepted2/248ms1344 KiB
14Accepted2/248ms1340 KiB
15Accepted2/248ms1188 KiB
16Accepted2/250ms1332 KiB
17Accepted2/250ms1332 KiB
18Accepted2/248ms1364 KiB
19Accepted2/248ms1332 KiB
20Accepted2/248ms1340 KiB
21Accepted2/248ms1392 KiB
22Accepted3/348ms1332 KiB
23Accepted3/348ms1352 KiB
24Accepted3/346ms1344 KiB