181182025-10-01 07:31:34MrkzZenehallgatáscpp17Time limit exceeded 15/50300ms1916 KiB
#include <bits/stdc++.h>
using namespace std;
int N,K;
vector<int> dalok;
vector<int> most;

int main()
{
    //ifstream f("be2.txt");
    cin>>N>>K;
    dalok.resize(N+1);
    most.resize(K+1);
    int ciklus=0;
    for(int i=1;i<=N;i++){
        cin>>dalok[i];
        ciklus+=dalok[i];
    }
    for(int q=1;q<=K;q++){
        cin>>most[q];
        most[q]%=ciklus;
        int ossz=0;
        for(int i=1;i<=N;i++){
            ossz+=dalok[i];
            if(ossz>=most[q]){
                cout<<i<<" ";
                i=N+1;
            }
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms500 KiB
2Time limit exceeded0/0284ms1844 KiB
3Accepted2/24ms316 KiB
4Accepted2/24ms316 KiB
5Accepted2/24ms316 KiB
6Accepted3/34ms500 KiB
7Accepted3/34ms316 KiB
8Accepted3/34ms316 KiB
9Time limit exceeded0/2279ms1844 KiB
10Time limit exceeded0/2279ms1916 KiB
11Time limit exceeded0/2298ms1692 KiB
12Time limit exceeded0/2287ms1844 KiB
13Time limit exceeded0/2282ms1856 KiB
14Time limit exceeded0/2282ms1844 KiB
15Time limit exceeded0/2300ms1824 KiB
16Time limit exceeded0/2282ms1844 KiB
17Time limit exceeded0/2282ms1620 KiB
18Time limit exceeded0/2282ms1588 KiB
19Time limit exceeded0/2300ms1688 KiB
20Time limit exceeded0/2273ms1560 KiB
21Time limit exceeded0/2277ms1592 KiB
22Time limit exceeded0/3279ms1588 KiB
23Time limit exceeded0/3300ms1568 KiB
24Time limit exceeded0/3275ms1588 KiB