239322026-02-01 13:50:57ProgramozoRokaMI bróker (50 pont)cpp17Time limit exceeded 8/501.1s1676 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, q,v,e;
	cin >> n >> q;
	vector<int> ar(n);
	vector<int> megold;
	megold.reserve(q);
	vector<vector<int>> memoria(501, vector<int>(501, -1000000000));
	for (int i = 0; i < n; ++i) cin >> ar[i];
	for (int i = 0; i < q; ++i)
	{
		cin >> v >> e;
		if (memoria[v][e] == -1000000000)
		{
			bool van = 0;
			memoria[v][e] = 0;
			for (int j = 0; j < n; ++j)
			{
				if (!van and ar[j] <= v)
				{
					van = 1;
					memoria[v][e] -= ar[j];
				}
				else if (van and ar[j] >= e)
				{
					van = 0;
					memoria[v][e] += ar[j];
				}
			}
		}
		megold.push_back(memoria[v][e]);
	}
	for (int i = 0; i < megold.size(); ++i) cout << megold[i] << "\n";

}
SubtaskSumTestVerdictTimeMemory
base8/50
1Accepted0/02ms1332 KiB
2Time limit exceeded0/01.083s1480 KiB
3Accepted1/12ms1332 KiB
4Accepted1/12ms1332 KiB
5Accepted2/22ms1332 KiB
6Accepted2/24ms1468 KiB
7Accepted2/24ms1460 KiB
8Time limit exceeded0/11.082s1588 KiB
9Time limit exceeded0/11.1s1556 KiB
10Time limit exceeded0/21.1s1480 KiB
11Time limit exceeded0/21.083s1332 KiB
12Time limit exceeded0/21.075s1484 KiB
13Time limit exceeded0/21.1s1484 KiB
14Time limit exceeded0/21.098s1480 KiB
15Time limit exceeded0/31.077s1332 KiB
16Time limit exceeded0/31.08s1516 KiB
17Time limit exceeded0/31.1s1476 KiB
18Time limit exceeded0/31.1s1488 KiB
19Time limit exceeded0/31.083s1332 KiB
20Time limit exceeded0/31.083s1332 KiB
21Time limit exceeded0/31.08s1676 KiB
22Time limit exceeded0/31.08s1332 KiB
23Time limit exceeded0/31.083s1332 KiB
24Time limit exceeded0/31.074s1548 KiB