# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494925 | uncripted | Fountain (eJOI20_fountain) | C++11 | 499 ms | 35372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//unfin
#include<bits/stdc++.h>
#define s second
#define f first
using namespace std;
pair<long long,long long> go[100050][20];
long long par[100050];
long long d[100050];
long long c[100050];
int main(){
long long n,q;
cin>>n>>q;
for(long long i=1; i<=n; i++){
cin>>d[i];
cin>>c[i];
}
d[n+1]=INT_MAX;
d[0]=INT_MAX;
stack<long long> s;
s.push(n+1);
for(long long i=n; i>=1; i--){
while(d[i]>=d[s.top()]){
s.pop();
}
go[i][0].s=s.top();
par[s.top()]=i;
go[i][0].f=c[i];
s.push(i);
}
/*
for(long long i=1; i<20; i++){
for(long long ii=1; ii<200005; ii++){
go[ii][i].s=long long_MAX;
}
}*/
for(long long i=1; i<20; i++){
for(long long ii=1; ii<100050; ii++){
go[ii][i].f=go[go[ii][i-1].s][i-1].f+go[ii][i-1].f;
go[ii][i].s=go[go[ii][i-1].s][i-1].s;
if(ii>n){
go[ii][i].s=n+1;
}
}
}
for(long long i=1; i<=q; i++){
long long x,y;
cin>>x>>y;
long long j=19;
long long st=x;
while(true){
if(y>=go[st][19].f){
cout<<"0"<<endl;
break;
}
bool bruh=false;
if(j==0 && y<=go[st][j].f){
cout<<st<<endl;
break;
}
while(y<go[st][j].f && j>0){
j--;
bruh=true;
}
y-=go[st][j].f;
// cout<<y<<" y"<<endl;
//cout<<j<<" "<<go[st][j].s<<" "<<go[st][j].f<<endl;
//cout<<st<<" "<<j<<endl;
// cout<<go[go[st][i-1].s][j-1].s<<"bruh "<<endl;
if(y<=0){
cout<<par[go[st][j].s]<<endl;
break;
}
//if()
st=go[st][j].s;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |