245002026-02-12 09:47:53imreerikdaniel08Zenehallgatáscpp17Wrong answer 4/50256ms2340 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<<upper_bound(dalok.begin()+1,dalok.end(),ido)-dalok.begin()<<" ";
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base4/50
1Wrong answer0/01ms508 KiB
2Time limit exceeded0/0246ms1324 KiB
3Accepted2/23ms316 KiB
4Accepted2/23ms316 KiB
5Wrong answer0/23ms316 KiB
6Wrong answer0/33ms316 KiB
7Wrong answer0/33ms536 KiB
8Wrong answer0/33ms500 KiB
9Time limit exceeded0/2256ms1316 KiB
10Time limit exceeded0/2250ms1332 KiB
11Time limit exceeded0/2254ms1316 KiB
12Time limit exceeded0/2246ms1332 KiB
13Time limit exceeded0/2252ms1332 KiB
14Time limit exceeded0/2246ms1844 KiB
15Time limit exceeded0/2252ms1316 KiB
16Time limit exceeded0/2243ms1332 KiB
17Time limit exceeded0/2246ms2340 KiB
18Time limit exceeded0/2252ms1332 KiB
19Time limit exceeded0/2240ms1152 KiB
20Time limit exceeded0/2236ms1332 KiB
21Time limit exceeded0/2245ms1332 KiB
22Time limit exceeded0/3238ms1332 KiB
23Time limit exceeded0/3245ms1360 KiB
24Time limit exceeded0/3216ms2100 KiB