76712024-01-10 12:00:13AblablablaZenehallgatáscpp17Time limit exceeded 23/50289ms5176 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;

    vector<int> prefix(n + 1, 0);
    for(int i = 1; i <= n; i++){
        cin >> prefix[i];
    }

    for(int i = 1; i <= n; i++){
        prefix[i] += prefix[i - 1];
    }

    for(int i = 0; i < m; i++){
        int akt;
        cin >> akt;
        akt %= prefix[n];

        int l = 0, r = n - 1;
        int valasz = 0;
        while(l <= r){
            int k = (l + r) / 2;

            if(prefix[k] < akt){
                valasz = k;
                l = k + 1;
            } else{
                r = k - 1;
            }
        }

        cout << valasz + 1 << " ";
    }
}
SubtaskSumTestVerdictTimeMemory
base23/50
1Accepted0/03ms1812 KiB
2Time limit exceeded0/0289ms2760 KiB
3Accepted2/24ms2544 KiB
4Accepted2/24ms2624 KiB
5Accepted2/24ms2716 KiB
6Accepted3/34ms2864 KiB
7Accepted3/34ms3000 KiB
8Accepted3/34ms3268 KiB
9Accepted2/2197ms3936 KiB
10Accepted2/2197ms4152 KiB
11Time limit exceeded0/2261ms4000 KiB
12Time limit exceeded0/2211ms4228 KiB
13Time limit exceeded0/2201ms4004 KiB
14Time limit exceeded0/2250ms3040 KiB
15Accepted2/2195ms4196 KiB
16Time limit exceeded0/2201ms4276 KiB
17Time limit exceeded0/2234ms4416 KiB
18Time limit exceeded0/2233ms4352 KiB
19Time limit exceeded0/2270ms3440 KiB
20Accepted2/2186ms4592 KiB
21Time limit exceeded0/2218ms4712 KiB
22Time limit exceeded0/3222ms4792 KiB
23Time limit exceeded0/3215ms5176 KiB
24Time limit exceeded0/3207ms5048 KiB