238512026-01-30 20:34:53sarminZenehallgatáscpp17Accepted 50/5052ms2780 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector<ll> a(n+1), pref(n+1);
    ll s = 0;
    for (int i = 1; i <= n; i++) {
    	cin >> a[i];
    	s += a[i];
    	pref[i] = pref[i-1] + a[i];
    }
	pref.push_back(INT_MAX);
    
    ll x;
    for (int i = 0; i < k; i++) {
    	cin >> x;
    	x = x%s;
    	int hol = lower_bound(pref.begin(), pref.end(), x) - pref.begin();
    	cout << hol << " ";
    }

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/052ms2612 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms316 KiB
6Accepted3/32ms316 KiB
7Accepted3/31ms512 KiB
8Accepted3/32ms316 KiB
9Accepted2/252ms2772 KiB
10Accepted2/252ms2776 KiB
11Accepted2/252ms2728 KiB
12Accepted2/252ms2780 KiB
13Accepted2/252ms2612 KiB
14Accepted2/252ms2772 KiB
15Accepted2/252ms2612 KiB
16Accepted2/252ms2612 KiB
17Accepted2/250ms2780 KiB
18Accepted2/250ms2576 KiB
19Accepted2/250ms2776 KiB
20Accepted2/248ms2612 KiB
21Accepted2/250ms2612 KiB
22Accepted3/350ms2572 KiB
23Accepted3/350ms2744 KiB
24Accepted3/348ms2612 KiB