82032024-01-12 18:34:08GervidZenehallgatáscpp17Wrong answer 0/50108ms13396 KiB
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>

using namespace std;

int main()
{
	int n, k, i, j, sum = 0, time, song;
	cin >> n >> k;

	map<int, int> songs;
	set<int> whole;

	for (i = 0; i < n; i++)
	{
		cin >> song;
		sum += song;

		songs[sum] = i;
	}

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

		time = (time - 1) % sum + 1;

		//cout << songs.upper_bound(time-1).operator*().second + 1 << ' ';
	}
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/03ms1960 KiB
2Wrong answer0/0108ms11576 KiB
3Wrong answer0/24ms2144 KiB
4Wrong answer0/23ms2340 KiB
5Wrong answer0/23ms2608 KiB
6Wrong answer0/33ms2752 KiB
7Wrong answer0/33ms2708 KiB
8Wrong answer0/34ms2976 KiB
9Wrong answer0/2107ms12272 KiB
10Wrong answer0/2105ms12160 KiB
11Wrong answer0/2104ms12164 KiB
12Wrong answer0/2104ms12452 KiB
13Wrong answer0/2101ms12504 KiB
14Wrong answer0/2101ms12396 KiB
15Wrong answer0/2101ms12660 KiB
16Wrong answer0/2101ms12744 KiB
17Wrong answer0/2100ms12680 KiB
18Wrong answer0/297ms12680 KiB
19Wrong answer0/297ms12680 KiB
20Wrong answer0/293ms12984 KiB
21Wrong answer0/294ms12968 KiB
22Wrong answer0/394ms13184 KiB
23Wrong answer0/393ms13396 KiB
24Wrong answer0/393ms13356 KiB