233302026-01-19 17:23:20KoszorusBlankaZenehallgatáscpp17Time limit exceeded 15/50300ms832 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;

    int ossz = 0;
    vector <int> T(N+1);
    
    for (int i = 1; i <= N; i++) {
        cin >> T[i];
        ossz += T[i];
    }
    
    int P;
    for (int i = 1; i <= K; i++) {
        cin >> P;
        int x = P%ossz;
        
        for (int j = 1; j <= N; j++) {
            x -= T[j];
            if (x <= 0) {
                cout << j << " ";
                break;
            }
        }
    }
    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms508 KiB
2Time limit exceeded0/0279ms820 KiB
3Accepted2/24ms316 KiB
4Accepted2/24ms316 KiB
5Accepted2/24ms316 KiB
6Accepted3/34ms316 KiB
7Accepted3/34ms508 KiB
8Accepted3/34ms316 KiB
9Time limit exceeded0/2287ms804 KiB
10Time limit exceeded0/2287ms808 KiB
11Time limit exceeded0/2300ms804 KiB
12Time limit exceeded0/2282ms564 KiB
13Time limit exceeded0/2277ms812 KiB
14Time limit exceeded0/2279ms564 KiB
15Time limit exceeded0/2300ms808 KiB
16Time limit exceeded0/2284ms812 KiB
17Time limit exceeded0/2282ms804 KiB
18Time limit exceeded0/2282ms832 KiB
19Time limit exceeded0/2300ms820 KiB
20Time limit exceeded0/2280ms820 KiB
21Time limit exceeded0/2293ms820 KiB
22Time limit exceeded0/3293ms820 KiB
23Time limit exceeded0/3300ms804 KiB
24Time limit exceeded0/3280ms820 KiB