211232026-01-12 12:17:19badamZenehallgatáscpp17Time limit exceeded 15/50257ms1376 KiB
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n, k, m;
    cin >> n >> k;
    int osszeg=0;
    int t[n];
    for(int i=0;i<n;i++)
    {
        cin>>m;
        osszeg=osszeg+m;
        t[i]=osszeg;
    }
    for(int i=0;i<k;i++)
    {
        cin >> m;
        int y=m%osszeg;
        int *ptr=lower_bound(t,t+n,y);
        int j=ptr-t;
        cout << j+1 << " ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0254ms1328 KiB
3Accepted2/23ms316 KiB
4Accepted2/23ms316 KiB
5Accepted2/23ms316 KiB
6Accepted3/33ms316 KiB
7Accepted3/33ms332 KiB
8Accepted3/33ms508 KiB
9Time limit exceeded0/2250ms1176 KiB
10Time limit exceeded0/2257ms1336 KiB
11Time limit exceeded0/2250ms1216 KiB
12Time limit exceeded0/2254ms1356 KiB
13Time limit exceeded0/2256ms1372 KiB
14Time limit exceeded0/2256ms1164 KiB
15Time limit exceeded0/2250ms1376 KiB
16Time limit exceeded0/2247ms1332 KiB
17Time limit exceeded0/2248ms1296 KiB
18Time limit exceeded0/2252ms1344 KiB
19Time limit exceeded0/2252ms1264 KiB
20Time limit exceeded0/2243ms1364 KiB
21Time limit exceeded0/2250ms1332 KiB
22Time limit exceeded0/3250ms1336 KiB
23Time limit exceeded0/3243ms1312 KiB
24Time limit exceeded0/3219ms1332 KiB