255702026-02-20 19:33:46matekimado11MI bróker (50 pont)cpp17Time limit exceeded 8/501.1s576 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int>arak;
signed main() {
	int n,q;
	cin>>n>>q;
	arak.resize(n);
	for(auto &i:arak)cin>>i;
	for(int i=0;i<q;i++)
	{
		int a,b;
		int vane=false;
		cin>>a>>b;
		int ans=0;
		for(int j=0;j<n;j++)
		{
			if(vane==false&&arak[j]<=a){ans-=arak[j];vane=true;}
			if(vane==true&&arak[j]>=b){ans+=arak[j];vane=false;}
		}
		cout<<ans<<'\n';
	}
}
SubtaskSumTestVerdictTimeMemory
base8/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/01.082s476 KiB
3Accepted1/11ms504 KiB
4Accepted1/11ms508 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Time limit exceeded0/11.098s488 KiB
9Time limit exceeded0/11.1s484 KiB
10Time limit exceeded0/21.1s476 KiB
11Time limit exceeded0/21.088s564 KiB
12Time limit exceeded0/21.08s572 KiB
13Time limit exceeded0/21.1s500 KiB
14Time limit exceeded0/21.1s508 KiB
15Time limit exceeded0/31.08s480 KiB
16Time limit exceeded0/31.082s552 KiB
17Time limit exceeded0/31.098s484 KiB
18Time limit exceeded0/31.098s488 KiB
19Time limit exceeded0/31.072s560 KiB
20Time limit exceeded0/31.093s564 KiB
21Time limit exceeded0/31.085s576 KiB
22Time limit exceeded0/31.087s484 KiB
23Time limit exceeded0/31.085s564 KiB
24Time limit exceeded0/31.08s484 KiB