Submission #783834

#TimeUsernameProblemLanguageResultExecution timeMemory
783834AndrijaMFountain (eJOI20_fountain)C++14
30 / 100
95 ms1356 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,q; cin>>n>>q; vector<pair<int,int>>v; for(int i=0;i<n;i++) { int x,y; cin>>x>>y; v.push_back({x,y}); } while(q--) { int x,y; cin>>x>>y; x--; if(n<=1005) { int d=v[x].first;///x-1 y-=v[x].second; if(y>0) x++; if(y>0) while(true) { if(x>=n) { break; } if(d<v[x].first) { y-=v[x].second; d=v[x].first; } if(y<=0)break; x++; } x++; if(x>n)x=0; cout<<x<<endl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...