# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382837 | aris12345678 | Fountain (eJOI20_fountain) | C++14 | 1572 ms | 2412 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>
using namespace std;
const int mxN = 1e6+5;
int diam[mxN], cap[mxN], pref[mxN];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for(int i = 1; i <= n; i++) {
scanf("%d%d", &diam[i], &cap[i]);
pref[i] = cap[i]+pref[i-1];
}
if(is_sorted(diam+1, diam+n+1)) {
while(q--) {
int r, v;
scanf("%d%d", &r, &v);
int st = 1, en = n, ans, md;
while(st <= en) {
md = (st+en)/2;
if(pref[md]-pref[r-1] < v)
st = md+1;
else
ans = md, en = md-1;
}
if(pref[n]-pref[r-1] < v)
printf("0\n");
else
printf("%d\n", ans);
}
} else {
while(q--) {
int r, v;
scanf("%d%d", &r, &v);
int ans = 0, sum = 0, prev = r;
for(int i = r; i <= n; i++) {
if(diam[i] > diam[prev] || i == prev) {
sum += cap[i], prev = i;
if(sum >= v) {
ans = i;
break;
}
}
}
printf("%d\n", ans);
}
}
return 0;
}
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... |