211302026-01-12 12:27:38bombinigusiniZenehallgatáscpp17Accepted 50/5054ms1356 KiB
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k, s;
    cin>>n>>k;
    int t[n];
    int ossz=0;
    for(int i=0; i<n; i++)
    {
        cin>>s;
        ossz=ossz+s;
        t[i]=ossz;
    }
    for(int i=0; i<k; i++)
    {
        cin>>s;
        int p=s%ossz;
        int *ptr=lower_bound(t, t+n, p);
        int r=ptr-t;
        cout<<r+1<<" ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms512 KiB
2Accepted0/054ms1332 KiB
3Accepted2/22ms316 KiB
4Accepted2/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms492 KiB
9Accepted2/252ms1164 KiB
10Accepted2/252ms1208 KiB
11Accepted2/252ms1332 KiB
12Accepted2/252ms1328 KiB
13Accepted2/252ms1172 KiB
14Accepted2/252ms1332 KiB
15Accepted2/252ms1356 KiB
16Accepted2/252ms1328 KiB
17Accepted2/252ms1212 KiB
18Accepted2/250ms1332 KiB
19Accepted2/250ms1300 KiB
20Accepted2/250ms1332 KiB
21Accepted2/250ms1152 KiB
22Accepted3/350ms1332 KiB
23Accepted3/350ms1344 KiB
24Accepted3/350ms1332 KiB