# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379271 | nafis_shifat | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 641 ms | 11372 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 ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
int main() {
int n,q;
cin >> n >> q;
ll d[n + 1];
for(int i = 1; i <= n; i++) scanf("%lld",&d[i]);
ll jump[n + 2];
jump[0] = 1;
for(int i = 1; i <= n; i++) {
jump[i] = jump[i - 1] * ((d[i] + jump[i - 1] - 1) / jump[i - 1]);
}
while(q--) {
ll t,l,r;
scanf("%lld %lld %lld",&t,&l,&r);
int lo = 0;
int hi = n;
int upb = 1,lwb = -1;
while(lo <= hi) {
int mid = lo + hi >> 1;
ll x = t / jump[mid];
ll p = -mid + x * jump[mid];
if(p <= r) {
upb = mid;
hi = mid - 1;
} else {
lo = mid + 1;
}
}
lo = 0;
hi = n;
while(lo <= hi) {
int mid = lo + hi >> 1;
ll x = t / jump[mid];
ll p = -mid + x * jump[mid];
if(p >= l) {
lwb = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
int ans;
if(lwb < upb) ans = 0;
else ans = lwb - upb + 1;
printf("%d\n",ans );
}
}
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... |