217442026-01-13 18:57:51KassayAkosZenehallgatáscpp17Time limit exceeded 15/50259ms1364 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> hossz(n);
    for (int i=0;i<n;i++)
    {
        cin >> hossz[i];
    }
    for (int i=1;i<n;i++)
    {
        hossz[i]+=hossz[i-1];
    }
    int x;
    int maradek;
    for (int i=0;i<k;i++)
    {
        cin >> x;
        maradek=x%hossz[n-1];
        if (maradek==0)
        {
            cout<<n<<" ";
        }
        else
        {
            cout<<lower_bound(hossz.begin(), hossz.end(), maradek) - hossz.begin()+1<<" ";
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0248ms1320 KiB
3Accepted2/23ms508 KiB
4Accepted2/23ms508 KiB
5Accepted2/23ms316 KiB
6Accepted3/33ms316 KiB
7Accepted3/33ms316 KiB
8Accepted3/33ms316 KiB
9Time limit exceeded0/2259ms1312 KiB
10Time limit exceeded0/2257ms1316 KiB
11Time limit exceeded0/2250ms1364 KiB
12Time limit exceeded0/2243ms1328 KiB
13Time limit exceeded0/2254ms1328 KiB
14Time limit exceeded0/2256ms1332 KiB
15Time limit exceeded0/2246ms1332 KiB
16Time limit exceeded0/2240ms1332 KiB
17Time limit exceeded0/2246ms1308 KiB
18Time limit exceeded0/2252ms1332 KiB
19Time limit exceeded0/2250ms1332 KiB
20Time limit exceeded0/2236ms1332 KiB
21Time limit exceeded0/2247ms1332 KiB
22Time limit exceeded0/3240ms1332 KiB
23Time limit exceeded0/3246ms1332 KiB
24Time limit exceeded0/3223ms1336 KiB