Submission #469602

#TimeUsernameProblemLanguageResultExecution timeMemory
469602ItamarFountain (eJOI20_fountain)C++14
0 / 100
1586 ms1788 KiB
#include <vector> #include <algorithm> using namespace std; #include <iostream> vector<int> pre; int n; /*int lower_bo(int l, int r, int val) { int mid = (l + r) / 2; if (pre[mid] < val && (mid == n || pre[mid+1] >= val) ) { return mid+1; } if (pre[mid] < val) { return lower_bo(mid + 1, r, val); } if (pre[mid] > val) { return lower_bo(l, mid - 1, val); } }*/ int main() { int q; cin >> n >> q; vector<int> d; vector<int> c; pre.push_back(0); for (int i = 1; i < n+1; i++) { int x, y; cin >> x >> y; d.push_back(x); pre.push_back(y+pre[i-1]); c.push_back(y); } for (int i = 0; i < q; i++) { int r, v; cin >> r >> v; int it = r; while (v > c[r]) { if (r == n) { it = 0; break; } r++; v -= c[r]; } //int it = lower_bo(1, n, v + pre[r - 1]); cout << it << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...