207912026-01-09 07:41:57VietnameseButcherZenehallgatáscpp17Accepted 50/5050ms1472 KiB

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

using namespace std;

int n, k, l, i;

vector<int> v;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> k;
	v.push_back(0);
	for (i = 1; i <= n; ++i)
	{
		cin >> l;
		v.push_back(l+v.back());
	}
	for (i = 1; i <= k; ++i)
	{
		cin >> l;
		l = l % v.back();
		cout << distance(v.begin(), lower_bound(v.begin(), v.end(), l));
		cout << " ";
	}

	

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms512 KiB
2Accepted0/050ms1452 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted2/250ms1428 KiB
10Accepted2/250ms1472 KiB
11Accepted2/250ms1308 KiB
12Accepted2/250ms1300 KiB
13Accepted2/248ms1456 KiB
14Accepted2/248ms1456 KiB
15Accepted2/248ms1288 KiB
16Accepted2/250ms1452 KiB
17Accepted2/248ms1452 KiB
18Accepted2/248ms1452 KiB
19Accepted2/248ms1304 KiB
20Accepted2/248ms1456 KiB
21Accepted2/248ms1296 KiB
22Accepted3/348ms1420 KiB
23Accepted3/346ms1308 KiB
24Accepted3/348ms1468 KiB