Submission #576538

#TimeUsernameProblemLanguageResultExecution timeMemory
576538MuntherCarrotFountain (eJOI20_fountain)C++14
30 / 100
77 ms2520 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define all(x) x.begin(),x.end() int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n,q; cin >> n >> q; vector<ll> d(n+1,0),c(n+1,0); for(int i=1;i<=n;i++) cin >> d[i] >> c[i]; for(int i=1;i<n+1;i++) c[i]+=c[i-1]; while(q--){ int r,v; cin >> r >> v; v+=c[r-1]; int ans=lower_bound(c.begin()+1,c.end(),v)-c.begin(); cout << (ans > n ? 0:ans) << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...