oj.uz

Submission #452097

# Submission time Handle Problem Language Result Execution time Memory
452097 2021-08-03T19:06:24 Z Khizri Fountain (eJOI20_fountain) C++17
30 / 100
 1500 ms 39844 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,m,x[mxn],y[mxn],d[mxn],k;
vector<ll>vtt[mxn];
vector<ll>vt[mxn];
map<int,pii>mp;
map<pii,int>mpp;
ll f(vector<ll>vt){
	if(vt.size()==0){
		return 0;
	}
	return vt.back();
}
void dfs(int u){
	mp[u]={k,vt[k].size()};
	mpp[{k,vt[k].size()}]=u;
	vt[k].pb(f(vt[k])+y[u]);
	for(int v:vtt[u]){
		dfs(v);
	}
}
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i];
	}
	priority_queue<pair<pii,int>,vector<pair<pii,int>>,greater<pair<pii,int>>>q;
	for(int i=1;i<=n;i++){
		while(q.size()){
			if(q.top().F.F<x[i]){
				d[i]++;
				vtt[q.top().S].pb(i);
				q.pop();
			}
			else{
				break;
			}
		}
		q.push({{x[i],y[i]},i});
	}
	for(int i=1;i<=n;i++){
		if(d[i]==0){
			++k;
			dfs(i);
		}
	}
	while(m--){
		int a,b;
		cin>>a>>b;
		pii p=mp[a];
		int x=p.F,y=p.S;
		ll sum=0;
		if(y>0){
			sum+=vt[x][y-1];
		}
		auto it=lower_bound(all(vt[x]),sum+b);
		if(it==vt[x].end()){
			cout<<0<<endl;
		}
		else{
			int ind=(it-vt[x].begin());
			int ans=mpp[{x,ind}];
			cout<<ans<<endl;
		}
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 8 ms 10060 KB Output is correct
3 Correct 8 ms 10060 KB Output is correct
4 Correct 9 ms 10240 KB Output is correct
5 Correct 8 ms 9980 KB Output is correct
6 Correct 26 ms 13920 KB Output is correct
7 Correct 9 ms 10060 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1584 ms 39844 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 8 ms 10060 KB Output is correct
3 Correct 8 ms 10060 KB Output is correct
4 Correct 9 ms 10240 KB Output is correct
5 Correct 8 ms 9980 KB Output is correct
6 Correct 26 ms 13920 KB Output is correct
7 Correct 9 ms 10060 KB Output is correct
8 Execution timed out 1584 ms 39844 KB Time limit exceeded
9 Halted 0 ms 0 KB -