# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407204 | victoriad | Fountain (eJOI20_fountain) | C++14 | 1576 ms | 3868 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.
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,q;
cin>>n>>q;
int vo,r,l;
vector<long long int>v(n);
vector<long long int>d(n);
for(int i=0;i<n;i++){
cin>>d[i]>>v[i];
}
vector<int>con(n);
for(int i=0;i<n;i++){
bool b=false;
for(int k=i;k<n;k++){
if(d[i]<d[k]){
con[i]=k;
b=true;
break;
}
}
if(!b)con[i]=-1;
}
for(int i=0;i<q;i++){
cin>>r>>l;
r--;
l-=v[r];
if(l<=0)cout<<r+1<<"\n";
else{
int i=r;
while(l>0 || i!=-1){
l-=v[con[i]];
if(con[i]==-1){
cout<<0<<"\n";
break;
}
if(l<=0){
cout<<con[i]+1<<"\n";
break;
}
i=con[i];
}
if(i==-1)cout<<0<<"\n";
}
}
return 0;
}
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... |