Submission #8,140

2024-01-12 14:24:30

cpp17

Accepted 50/50

105ms

13860 KiB

#include <bits/stdc++.h>

using namespace std;

int i, t;

int main() {
    iostream::sync_with_stdio(0);
    cin.tie(0);
    int N, K;
    cin >> N >> K;
    int Ts = 0;
    map<int, int> L;
    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	1824 KiB
		2	Accepted	0/0	104ms	11580 KiB
		3	Accepted	2/2	3ms	2564 KiB
		4	Accepted	2/2	3ms	2624 KiB
		5	Accepted	2/2	3ms	3076 KiB
		6	Accepted	3/3	3ms	2804 KiB
		7	Accepted	3/3	3ms	2924 KiB
		8	Accepted	3/3	3ms	3160 KiB
		9	Accepted	2/2	101ms	12704 KiB
		10	Accepted	2/2	101ms	12844 KiB
		11	Accepted	2/2	104ms	12908 KiB
		12	Accepted	2/2	101ms	13028 KiB
		13	Accepted	2/2	101ms	12920 KiB
		14	Accepted	2/2	100ms	12980 KiB
		15	Accepted	2/2	101ms	12908 KiB
		16	Accepted	2/2	98ms	12908 KiB
		17	Accepted	2/2	98ms	13120 KiB
		18	Accepted	2/2	97ms	13128 KiB
		19	Accepted	2/2	97ms	13124 KiB
		20	Accepted	2/2	97ms	13328 KiB
		21	Accepted	2/2	105ms	13540 KiB
		22	Accepted	3/3	100ms	13680 KiB
		23	Accepted	3/3	98ms	13544 KiB
		24	Accepted	3/3	101ms	13860 KiB