Submission #7,910

2024-01-11 20:21:42

cpp17

Accepted 50/50

54ms

4512 KiB

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

using namespace std;

long long n, i, k, a,ido;
vector<int>x;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n>>k;
    for (i = 1; i <= n; ++i)
    {
        cin >> a;
        ido += a;
        x.push_back(ido);
    }
    for (i = 1; i <= k; ++i)
    {
        cin >> a;
        a = a % x[n - 1];
        cout << lower_bound(x.begin(), x.end(), a) - x.begin()+1<<" ";
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1892 KiB
		2	Accepted	0/0	52ms	3388 KiB
		3	Accepted	2/2	3ms	2344 KiB
		4	Accepted	2/2	3ms	2696 KiB
		5	Accepted	2/2	3ms	2648 KiB
		6	Accepted	3/3	3ms	2808 KiB
		7	Accepted	3/3	3ms	2820 KiB
		8	Accepted	3/3	3ms	3040 KiB
		9	Accepted	2/2	52ms	4308 KiB
		10	Accepted	2/2	52ms	4332 KiB
		11	Accepted	2/2	52ms	4260 KiB
		12	Accepted	2/2	54ms	4256 KiB
		13	Accepted	2/2	52ms	4280 KiB
		14	Accepted	2/2	52ms	4260 KiB
		15	Accepted	2/2	52ms	4256 KiB
		16	Accepted	2/2	52ms	4512 KiB
		17	Accepted	2/2	52ms	4468 KiB
		18	Accepted	2/2	52ms	4468 KiB
		19	Accepted	2/2	52ms	4480 KiB
		20	Accepted	2/2	50ms	4476 KiB
		21	Accepted	2/2	50ms	4472 KiB
		22	Accepted	3/3	50ms	4468 KiB
		23	Accepted	3/3	50ms	4464 KiB
		24	Accepted	3/3	50ms	4504 KiB