# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586956 | Halym2007 | Fountain (eJOI20_fountain) | C++14 | 23 ms | 4072 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 <bits/stdc++.h>
#define ff first
#define ss second
#define cont continue;
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 200009;
int n, q, a[N], jog, b[N], p[N], l, r;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i];
p[i] += p[i - 1] + b[i];
}
while ( q-- ) {
cin >> l >> r;
if (p[n] - p[l - 1] < r) {
cout << "0\n";
}
int l1 = l + 1, r1 = n;
while (l <= r) {
int md = (l + r) / 2;
if (p[md] - p[l - 1] < r) l = md + 1;
else {
r = md - 1;
jog = md;
}
}
cout << jog << "\n";
}
}
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... |