Submission #931427

#TimeUsernameProblemLanguageResultExecution timeMemory
931427kirakosyanFountain (eJOI20_fountain)C++17
0 / 100
180 ms3284 KiB
#include<algorithm> #include<iostream> #include<vector> #include<string> #include<random> #include<cmath> #include<stack> #include<map> #include <iomanip> #include <queue> #include <set> using namespace std; using ll = long long; using ull = unsigned long long; vector<ll>v,vis; vector<vector<ll>>gp; void solve(){ ll n,q; cin >> n >> q; vector<ll>d(n),c(n),pref(n); for(ll i=0;i<n;i++)cin >> d[i] >> c[i]; pref[0]=c[0]; for(ll i=1;i<n;i++){ pref[i]=pref[i-1]+c[i]; } // for(ll i=0;i<n;i++){ // cout<<pref[i]<<" "; // } // cout<<endl; for(ll i=0;i<q;i++){ ll a,b; cin >> a >> b; --a; if(a!=0){ a--; ll k=lower_bound(pref.begin(),pref.end(),pref[a]+b)-pref.begin(); cout<<k<<endl; } else{ ll k=lower_bound(pref.begin(),pref.end(),b)-pref.begin(); cout<<k<<endl; } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin.tie(nullptr); // ll _; cin >> _; // while (_--){ solve(); // } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...