Submission #9,242

2024-02-19 11:04:57

cpp17

Accepted 50/50

96ms

4932 KiB

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

using namespace std;

int main()
{
	cin.tie(0);
	int n, k, i, j, temp, time;
	cin >> n >> k;

	vector<int> sums(n);
	cin >> sums[0];

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

	for (i = 0; i < k; i++)
	{
		cin >> time;

		time %= sums[n - 1];

		auto x = upper_bound(sums.begin(), sums.end(), time);

		cout << x - sums.begin() - ((x - (x != sums.begin())).operator*() == time) + 1 << ' ';
	}
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1816 KiB
		2	Accepted	0/0	96ms	2760 KiB
		3	Accepted	2/2	4ms	2216 KiB
		4	Accepted	2/2	3ms	2304 KiB
		5	Accepted	2/2	3ms	2432 KiB
		6	Accepted	3/3	3ms	2516 KiB
		7	Accepted	3/3	3ms	2632 KiB
		8	Accepted	3/3	3ms	2768 KiB
		9	Accepted	2/2	96ms	3432 KiB
		10	Accepted	2/2	96ms	3660 KiB
		11	Accepted	2/2	94ms	3876 KiB
		12	Accepted	2/2	94ms	3956 KiB
		13	Accepted	2/2	92ms	4084 KiB
		14	Accepted	2/2	92ms	4160 KiB
		15	Accepted	2/2	92ms	4292 KiB
		16	Accepted	2/2	92ms	4404 KiB
		17	Accepted	2/2	90ms	4620 KiB
		18	Accepted	2/2	89ms	4700 KiB
		19	Accepted	2/2	89ms	4796 KiB
		20	Accepted	2/2	86ms	4828 KiB
		21	Accepted	2/2	86ms	4844 KiB
		22	Accepted	3/3	86ms	4932 KiB
		23	Accepted	3/3	86ms	4932 KiB
		24	Accepted	3/3	85ms	4916 KiB