Submission #8,139

2024-01-12 14:22:34

cpp17

Accepted 50/50

114ms

14516 KiB

#include <bits/stdc++.h>

using namespace std;

int main() {
    iostream::sync_with_stdio(0);
    cin.tie(0);
    int N, K;
    cin >> N >> K;
    vector<int> P(N);
    unsigned long long int Ts = 0;
    map<int, int> L;
    for(int i = 0, t; i < N; i++) {
        cin >> t;
        Ts += t;
        L[Ts] = i;
    }
    for(int i = 0, t; i < K; i++) {
        cin >> t;
        t %= Ts;
        cout << L.lower_bound(t)->second + 1 << " ";
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1832 KiB
		2	Accepted	0/0	108ms	12332 KiB
		3	Accepted	2/2	3ms	2412 KiB
		4	Accepted	2/2	3ms	2712 KiB
		5	Accepted	2/2	3ms	2692 KiB
		6	Accepted	3/3	3ms	2712 KiB
		7	Accepted	3/3	3ms	2960 KiB
		8	Accepted	3/3	3ms	2896 KiB
		9	Accepted	2/2	114ms	13244 KiB
		10	Accepted	2/2	101ms	13396 KiB
		11	Accepted	2/2	108ms	13508 KiB
		12	Accepted	2/2	103ms	13404 KiB
		13	Accepted	2/2	103ms	13600 KiB
		14	Accepted	2/2	101ms	13608 KiB
		15	Accepted	2/2	103ms	13820 KiB
		16	Accepted	2/2	100ms	14028 KiB
		17	Accepted	2/2	100ms	14028 KiB
		18	Accepted	2/2	104ms	14028 KiB
		19	Accepted	2/2	101ms	14244 KiB
		20	Accepted	2/2	101ms	14240 KiB
		21	Accepted	2/2	104ms	14328 KiB
		22	Accepted	3/3	103ms	14320 KiB
		23	Accepted	3/3	104ms	14316 KiB
		24	Accepted	3/3	101ms	14516 KiB