217372026-01-13 18:42:59ZsoltZenehallgatáscpp17Time limit exceeded 15/50300ms1212 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,k,ossz=0;
    cin>>n>>k;
    vector<int>p(n+1),ido(k);
    for(int i=1; i<=n; i++)
    {
        cin>>p[i];
        ossz+=p[i];
    }
    for(int i=0; i<k; i++)
    {
        cin>>ido[i];
    }
    int perc;
    for(int i=0; i<k; i++)
    {
        if(ido[i]<=ossz)
        {
            perc=ido[i];
        }
        else
        {
            perc=ido[i]%ossz;
        }
        for(int j=1; j<=n; j++)
        {
            if(p[j]<perc)
            {
                perc-=p[j];
            }
            else
            {
                cout<<j<<" ";
                break;
            }
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0284ms1200 KiB
3Accepted2/22ms512 KiB
4Accepted2/22ms316 KiB
5Accepted2/22ms316 KiB
6Accepted3/32ms316 KiB
7Accepted3/32ms316 KiB
8Accepted3/32ms316 KiB
9Time limit exceeded0/2300ms1192 KiB
10Time limit exceeded0/2300ms1200 KiB
11Time limit exceeded0/2300ms1192 KiB
12Time limit exceeded0/2291ms1208 KiB
13Time limit exceeded0/2282ms1212 KiB
14Time limit exceeded0/2284ms1196 KiB
15Time limit exceeded0/2300ms1076 KiB
16Time limit exceeded0/2277ms1076 KiB
17Time limit exceeded0/2282ms1196 KiB
18Time limit exceeded0/2286ms1076 KiB
19Time limit exceeded0/2300ms1196 KiB
20Time limit exceeded0/2284ms1076 KiB
21Time limit exceeded0/2284ms1204 KiB
22Time limit exceeded0/3287ms1076 KiB
23Time limit exceeded0/3300ms1076 KiB
24Time limit exceeded0/3282ms1076 KiB