Submission #3,825

2023-03-03 10:22:03

cpp14

Accepted 50/50

104ms

13468 KiB

#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define fi first
#define se second

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k, l=0;
    cin >> n >> k;
    set<pii> s;
    for (int i=1; i<=n; i++){
        int t;
        cin >> t;
        l += t;
        s.insert({l, i});
    }
    while (k--){
        int t;
        cin >> t;
        t %= l;
        if (!t) t = l;
        cout << (*s.lower_bound({t, 0})).se << " ";
    }
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	98ms	11568 KiB
		3	Accepted	2/2	3ms	2420 KiB
		4	Accepted	2/2	3ms	2732 KiB
		5	Accepted	2/2	3ms	2684 KiB
		6	Accepted	3/3	3ms	3136 KiB
		7	Accepted	3/3	3ms	3160 KiB
		8	Accepted	3/3	3ms	3248 KiB
		9	Accepted	2/2	97ms	12712 KiB
		10	Accepted	2/2	103ms	12844 KiB
		11	Accepted	2/2	98ms	12964 KiB
		12	Accepted	2/2	104ms	13260 KiB
		13	Accepted	2/2	97ms	13252 KiB
		14	Accepted	2/2	97ms	13240 KiB
		15	Accepted	2/2	94ms	13360 KiB
		16	Accepted	2/2	101ms	13188 KiB
		17	Accepted	2/2	98ms	13276 KiB
		18	Accepted	2/2	96ms	13424 KiB
		19	Accepted	2/2	101ms	13260 KiB
		20	Accepted	2/2	97ms	13244 KiB
		21	Accepted	2/2	96ms	13244 KiB
		22	Accepted	3/3	94ms	13252 KiB
		23	Accepted	3/3	96ms	13340 KiB
		24	Accepted	3/3	96ms	13468 KiB