181202025-10-01 07:42:50MrkzZenehallgatáscpp17Wrong answer 0/50241ms2100 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];
    }
    int ossz=0;
    int q=1;
    int i=1;
    while(q<=K){
        cin>>most[q];
        most[q]%=ciklus;
        while(ossz<most[q])
            ossz+=dalok[i];
        if(ossz>=most[q]){
            cout<<i<<" ";
            q++;
        }
        if(i==N+1)
            i=1;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms508 KiB
2Time limit exceeded0/0231ms1844 KiB
3Wrong answer0/23ms316 KiB
4Wrong answer0/23ms316 KiB
5Wrong answer0/23ms316 KiB
6Wrong answer0/33ms316 KiB
7Wrong answer0/33ms316 KiB
8Wrong answer0/33ms500 KiB
9Time limit exceeded0/2241ms1964 KiB
10Time limit exceeded0/2241ms1960 KiB
11Time limit exceeded0/2233ms2100 KiB
12Time limit exceeded0/2228ms2100 KiB
13Time limit exceeded0/2231ms2096 KiB
14Time limit exceeded0/2236ms2100 KiB
15Time limit exceeded0/2234ms2092 KiB
16Time limit exceeded0/2225ms1844 KiB
17Time limit exceeded0/2236ms1844 KiB
18Time limit exceeded0/2233ms1964 KiB
19Time limit exceeded0/2228ms2100 KiB
20Time limit exceeded0/2219ms1848 KiB
21Time limit exceeded0/2225ms1988 KiB
22Time limit exceeded0/3231ms1972 KiB
23Time limit exceeded0/3231ms1968 KiB
24Time limit exceeded0/3204ms1964 KiB