Submission #1,744

2022-12-02 13:41:52

cpp11

Accepted 50/50

50ms

5652 KiB

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long i, n, m, a;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;

    vector<long long> prefixSum(n + 1);

    for (i = 1; i <= n; ++i)
    {
        cin >> prefixSum[i];
        prefixSum[i] += prefixSum[i - 1];
    }

    for (i = 1; i <= m; ++i)
    {
        cin >> a;

        a = a % prefixSum[n];

        cout << lower_bound(prefixSum.begin() + 1, prefixSum.end(), a) - prefixSum.begin() << " ";
    }

    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	50ms	3536 KiB
		3	Accepted	2/2	3ms	2328 KiB
		4	Accepted	2/2	3ms	2628 KiB
		5	Accepted	2/2	3ms	2684 KiB
		6	Accepted	3/3	3ms	2896 KiB
		7	Accepted	3/3	2ms	3096 KiB
		8	Accepted	3/3	2ms	3296 KiB
		9	Accepted	2/2	50ms	4772 KiB
		10	Accepted	2/2	50ms	4968 KiB
		11	Accepted	2/2	50ms	4976 KiB
		12	Accepted	2/2	50ms	5176 KiB
		13	Accepted	2/2	50ms	5176 KiB
		14	Accepted	2/2	50ms	5280 KiB
		15	Accepted	2/2	48ms	5280 KiB
		16	Accepted	2/2	50ms	5280 KiB
		17	Accepted	2/2	50ms	5272 KiB
		18	Accepted	2/2	48ms	5280 KiB
		19	Accepted	2/2	48ms	5268 KiB
		20	Accepted	2/2	48ms	5276 KiB
		21	Accepted	2/2	48ms	5444 KiB
		22	Accepted	3/3	48ms	5448 KiB
		23	Accepted	3/3	48ms	5648 KiB
		24	Accepted	3/3	48ms	5652 KiB