94972024-02-22 12:13:31zeytonxMI bróker (50 pont)cpp17Wrong answer 0/50407ms116784 KiB
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define fs first
#define sc second

const ll MOD = 1e9+7;

void solve()
{
	ll n, q;
	cin >> n >> q;
	vector<ll> p(n);
	
	map<ll, vll> lw, bg;

	for(ll i = 0; i < n; i++)
	{
		cin >> p[i];
		for(ll j = p[i]; j <= 500; j++)
			lw[j].push_back(i);
		for(ll j = 0; j <= p[i]; j++)
			bg[j].push_back(i);
	}

	vector<pll> qr(q);
	for(auto &i : qr)
		cin >> i.fs >> i.sc;
	
	for(auto i : qr)
	{
		ll ans = 0;
		ll i1 = 0, i2 = -1;
		
		
		
		cout << ans << "\n";
	}
	cout << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
        solve();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/03ms2052 KiB
2Wrong answer0/0333ms98476 KiB
3Wrong answer0/13ms2452 KiB
4Wrong answer0/13ms2796 KiB
5Wrong answer0/237ms14168 KiB
6Wrong answer0/2342ms108052 KiB
7Wrong answer0/2344ms108408 KiB
8Wrong answer0/1317ms113692 KiB
9Wrong answer0/1337ms114852 KiB
10Wrong answer0/2405ms116712 KiB
11Wrong answer0/2379ms116324 KiB
12Wrong answer0/2407ms116248 KiB
13Wrong answer0/2407ms116784 KiB
14Wrong answer0/2405ms116464 KiB
15Wrong answer0/3384ms113312 KiB
16Wrong answer0/3374ms113860 KiB
17Wrong answer0/3374ms114940 KiB
18Wrong answer0/3388ms113472 KiB
19Wrong answer0/3372ms113916 KiB
20Wrong answer0/3372ms114692 KiB
21Wrong answer0/3384ms115732 KiB
22Wrong answer0/3375ms115668 KiB
23Wrong answer0/3382ms114680 KiB
24Wrong answer0/3386ms114580 KiB