| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 67164 | imeimi2000 | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 0 ms | 0 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 <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
int n;
llong d[500001];
int getPos(int i, int t) {
return i - t / d[i] * d[i];
}
int lowbound(int x, int t) {
int s = 0, e = n + 1;
while (s < e) {
int m = (s + e) / 2;
if (getPos(m, t) < x) s = m + 1;
else e = m;
}
return s;
}
int main() {
int q;
scanf("%d%d", &n, &q);
d[0] = 1;
for (int i = 1; i <= n; ++i) {
scanf("%lld", d + i);
d[i] = ((d[i] - 1) / d[i - 1] + 1) * d[i - 1];
}
while (q--) {
int t, l, r;
cin >> t >> l >> r;
printf("%d\n", lowbound(-l + 1, t) - lowbound(-r, t));
}
return 0;
}