207802026-01-08 20:55:08szabelrZenehallgatáscpp17Accepted 50/5052ms1916 KiB
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n, k,x;
    cin >> n >> k;
    vector<ll>zenek(n+1);
    zenek[0] = 0;
    for (ll i = 1; i <= n; i++)
    {
        cin >> x;
        zenek[i] = zenek[i - 1] + x;
    }
    for (ll i = 1; i <= k; i++) {
        cin >> x;
        if (x > zenek[n] ) {
            x = x % zenek[n];
        }
        if (x == 0) {
            cout << 1;
        }
        else
        {
            auto it = lower_bound(zenek.begin(), zenek.end(), x);
            cout << distance(zenek.begin(), it) << " ";
        }
    }

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/02ms316 KiB
2Accepted0/052ms1584 KiB
3Accepted2/22ms508 KiB
4Accepted2/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted2/250ms1592 KiB
10Accepted2/252ms1760 KiB
11Accepted2/252ms1588 KiB
12Accepted2/252ms1588 KiB
13Accepted2/250ms1728 KiB
14Accepted2/250ms1732 KiB
15Accepted2/250ms1588 KiB
16Accepted2/252ms1588 KiB
17Accepted2/250ms1588 KiB
18Accepted2/250ms1560 KiB
19Accepted2/250ms1588 KiB
20Accepted2/250ms1588 KiB
21Accepted2/248ms1588 KiB
22Accepted3/348ms1588 KiB
23Accepted3/348ms1576 KiB
24Accepted3/348ms1916 KiB