# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919713 | eggx50000 | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 481 ms | 25424 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 <iostream>
#include <vector>
using namespace std;
using ll = long long;
int n, q;
ll arr[500099], t, l, r;
ll f(ll t, ll v){
int s = 0, e = n;
while(s <= e){
int mid = (s + e) / 2;
if(-mid + t / arr[mid] * arr[mid] >= v) s = mid + 1;
else e = mid - 1;
}
return e + 1;
}
int main()
{
scanf("%d %d", &n, &q);
arr[0] = 1;
for(int i = 1; i <= n; i ++){
scanf("%lld", arr + i);
arr[i] = max(arr[i], arr[i - 1]);
arr[i] = arr[i - 1] * ((arr[i - 1] + arr[i] - 1) / arr[i - 1]);
}
while(q --){
scanf("%lld %lld %lld", &t, &l, &r);
printf("%lld\n", f(t, l) - f(t, r + 1));
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... |