207372026-01-08 18:26:32KoszorusBlankaZenehallgatáscpp17Time limit exceeded 0/50300ms1780 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    vector <int> T(N+1);
    for (int i = 1; i <= N; i++) { cin >> T[i]; }

    vector <int> P(K+1), v(K+1);
    for (int i = 1; i <= K; i++) {
        cin >> P[i];
        int j = 1;
        while (P[i] >= 0) {
                P[i] -= T[j];
                j++;
                if (j == N) { j = 1; }
        }
        v[i] = j;
    }

    for (int i = 1; i <= K; i++) { cout << v[i] << " "; }

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0282ms1332 KiB
3Wrong answer0/2181ms512 KiB
4Time limit exceeded0/2282ms316 KiB
5Time limit exceeded0/2300ms316 KiB
6Time limit exceeded0/3282ms316 KiB
7Time limit exceeded0/3282ms316 KiB
8Time limit exceeded0/3284ms508 KiB
9Time limit exceeded0/2298ms1584 KiB
10Time limit exceeded0/2284ms1332 KiB
11Time limit exceeded0/2277ms1332 KiB
12Time limit exceeded0/2279ms1604 KiB
13Time limit exceeded0/2300ms1332 KiB
14Time limit exceeded0/2287ms1780 KiB
15Time limit exceeded0/2284ms1332 KiB
16Time limit exceeded0/2287ms1356 KiB
17Time limit exceeded0/2300ms1568 KiB
18Time limit exceeded0/2289ms1588 KiB
19Time limit exceeded0/2284ms1336 KiB
20Time limit exceeded0/2286ms1588 KiB
21Time limit exceeded0/2300ms1332 KiB
22Time limit exceeded0/3286ms1588 KiB
23Time limit exceeded0/3284ms1332 KiB
24Time limit exceeded0/3286ms1604 KiB