#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 500000;
int d[1 + nmax];
int eval(int x, int t){
return -x + t - t % d[x];
}
int greaterthan(int n, int target, int t){
if(eval(0, t) < target)
return 0;
int x = 0;
for(int jump = (1 << 20); 0 < jump; jump /= 2)
if(x + jump <= n && target <= eval(x + jump, t))
x += jump;
return x + 1;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
d[0] = 1;
for(int i = 1;i <= n; i++){
cin >> d[i];
if(d[i] <= d[i - 1])
d[i] = d[i - 1];
else
d[i] = d[i - 1] * (d[i] / d[i - 1] + (0 < (d[i] % d[i - 1])));
}
for(int i = 1; i <= q; i++){
int x, y, t;
cin >> t >> x >> y;
cout << greaterthan(n, x, t) - greaterthan(n, y + 1, t) << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
617 ms |
20728 KB |
Output is correct |
2 |
Correct |
635 ms |
20920 KB |
Output is correct |
3 |
Correct |
633 ms |
20864 KB |
Output is correct |
4 |
Correct |
633 ms |
20948 KB |
Output is correct |
5 |
Correct |
609 ms |
20964 KB |
Output is correct |
6 |
Correct |
593 ms |
20728 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
617 ms |
20728 KB |
Output is correct |
2 |
Correct |
635 ms |
20920 KB |
Output is correct |
3 |
Correct |
633 ms |
20864 KB |
Output is correct |
4 |
Correct |
633 ms |
20948 KB |
Output is correct |
5 |
Correct |
609 ms |
20964 KB |
Output is correct |
6 |
Correct |
593 ms |
20728 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
5 ms |
384 KB |
Output is correct |
13 |
Correct |
412 ms |
19288 KB |
Output is correct |
14 |
Correct |
412 ms |
20100 KB |
Output is correct |
15 |
Correct |
410 ms |
18552 KB |
Output is correct |
16 |
Correct |
423 ms |
19064 KB |
Output is correct |
17 |
Correct |
507 ms |
23416 KB |
Output is correct |
18 |
Correct |
516 ms |
23288 KB |
Output is correct |
19 |
Correct |
505 ms |
23440 KB |
Output is correct |
20 |
Correct |
489 ms |
23288 KB |
Output is correct |
21 |
Correct |
497 ms |
23416 KB |
Output is correct |
22 |
Correct |
521 ms |
23416 KB |
Output is correct |
23 |
Correct |
500 ms |
23288 KB |
Output is correct |
24 |
Correct |
503 ms |
23496 KB |
Output is correct |
25 |
Correct |
633 ms |
20984 KB |
Output is correct |
26 |
Correct |
619 ms |
20984 KB |
Output is correct |
27 |
Correct |
537 ms |
23020 KB |
Output is correct |
28 |
Correct |
509 ms |
23288 KB |
Output is correct |
29 |
Correct |
524 ms |
22904 KB |
Output is correct |
30 |
Correct |
535 ms |
22920 KB |
Output is correct |
31 |
Correct |
537 ms |
23288 KB |
Output is correct |
32 |
Correct |
521 ms |
19448 KB |
Output is correct |
33 |
Correct |
5 ms |
384 KB |
Output is correct |