244422026-02-11 16:17:39gyarturZenehallgatáscpp17Time limit exceeded 15/50261ms1336 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    /*ios_base::sync_with_stdio(false);
    cin.tie(nullptr);*/

    int n, k;
    int total = 0;
    cin>>n>>k;
    vector<int> dalok(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;
        cout<<lower_bound(dalok.begin()+1, dalok.end(), ido)-dalok.begin()<<' ';
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0256ms1324 KiB
3Accepted2/23ms512 KiB
4Accepted2/23ms316 KiB
5Accepted2/23ms316 KiB
6Accepted3/33ms356 KiB
7Accepted3/33ms316 KiB
8Accepted3/34ms508 KiB
9Time limit exceeded0/2246ms1316 KiB
10Time limit exceeded0/2245ms1332 KiB
11Time limit exceeded0/2246ms1316 KiB
12Time limit exceeded0/2254ms1336 KiB
13Time limit exceeded0/2246ms1324 KiB
14Time limit exceeded0/2246ms1332 KiB
15Time limit exceeded0/2254ms1320 KiB
16Time limit exceeded0/2261ms1316 KiB
17Time limit exceeded0/2244ms1336 KiB
18Time limit exceeded0/2240ms1324 KiB
19Time limit exceeded0/2240ms1316 KiB
20Time limit exceeded0/2241ms1328 KiB
21Time limit exceeded0/2241ms1312 KiB
22Time limit exceeded0/3246ms1332 KiB
23Time limit exceeded0/3246ms1332 KiB
24Time limit exceeded0/3221ms1336 KiB