Submission #8,145

2024-01-12 14:34:47

cpp17

Accepted 50/50

104ms

13676 KiB

#include <bits/stdc++.h>

using namespace std;

int N, K, Ts, i, t;
map<int, int> L;

int main() {
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> K;
    for(i = 0; i < N; ++i) {
        cin >> t;
        Ts += t;
        L[Ts] = i;
    }
    for(i = 0; 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	1896 KiB
		2	Accepted	0/0	101ms	11592 KiB
		3	Accepted	2/2	3ms	2476 KiB
		4	Accepted	2/2	3ms	2684 KiB
		5	Accepted	2/2	3ms	2900 KiB
		6	Accepted	3/3	3ms	3112 KiB
		7	Accepted	3/3	3ms	3072 KiB
		8	Accepted	3/3	3ms	3364 KiB
		9	Accepted	2/2	100ms	12660 KiB
		10	Accepted	2/2	98ms	12664 KiB
		11	Accepted	2/2	97ms	12652 KiB
		12	Accepted	2/2	97ms	12852 KiB
		13	Accepted	2/2	97ms	12660 KiB
		14	Accepted	2/2	97ms	12876 KiB
		15	Accepted	2/2	97ms	12868 KiB
		16	Accepted	2/2	97ms	12864 KiB
		17	Accepted	2/2	98ms	13228 KiB
		18	Accepted	2/2	101ms	13012 KiB
		19	Accepted	2/2	101ms	13236 KiB
		20	Accepted	2/2	97ms	13372 KiB
		21	Accepted	2/2	97ms	13236 KiB
		22	Accepted	3/3	104ms	13368 KiB
		23	Accepted	3/3	104ms	13496 KiB
		24	Accepted	3/3	104ms	13676 KiB