207902026-01-09 07:39:43VietnameseButcherZenehallgatáscpp17Time limit exceeded 15/50261ms1504 KiB

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

using namespace std;

int n, k, l, i;

vector<int> v;

int main()
{
	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
base15/50
1Accepted0/01ms500 KiB
2Time limit exceeded0/0256ms1452 KiB
3Accepted2/23ms316 KiB
4Accepted2/23ms316 KiB
5Accepted2/23ms500 KiB
6Accepted3/33ms316 KiB
7Accepted3/33ms508 KiB
8Accepted3/33ms508 KiB
9Time limit exceeded0/2254ms1296 KiB
10Time limit exceeded0/2261ms1332 KiB
11Time limit exceeded0/2252ms1412 KiB
12Time limit exceeded0/2254ms1496 KiB
13Time limit exceeded0/2254ms1472 KiB
14Time limit exceeded0/2247ms1452 KiB
15Time limit exceeded0/2247ms1456 KiB
16Time limit exceeded0/2254ms1452 KiB
17Time limit exceeded0/2248ms1452 KiB
18Time limit exceeded0/2254ms1428 KiB
19Time limit exceeded0/2246ms1448 KiB
20Time limit exceeded0/2241ms1452 KiB
21Time limit exceeded0/2241ms1452 KiB
22Time limit exceeded0/3241ms1292 KiB
23Time limit exceeded0/3252ms1504 KiB
24Time limit exceeded0/3217ms1452 KiB