# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135134 | doowey | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 12 ms | 2424 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)1e5 + 9;
const ll MAX = (ll)5e9;
ll per[N];
ll compute(int id, ll tim){
return (tim-(tim%per[id]))-id;
}
int main(){
fastIO;
int n, q;
cin >> n >> q;
cin >> per[1];
for(int i = 2; i <= n; i ++ ){
cin >> per[i];
per[i] = (per[i - 1] * ((per[i] - 1) / per[i-1] + 1));
per[i] = min(per[i], MAX);
}
ll L, R, T;
ll res;
int lf, rf, md;
int p1, p2;
for(int i = 0 ; i < q; i ++ ){
cin >> T >> L >> R;
p1 = 0;
p2 = n;
for(int j = 19; j >= 0 ; j -- ){
if(p1 + (1 << j) <= n){
if(compute(p1 + (1 << j), T) >= L)
p1 += (1 << j);
}
if(p2 - (1 << j) >= 1){
if(compute(p2 - (1 << j), T) <= R){
p2 -= (1 << j);
}
}
}
cout << max(0, p1 - p2 + 1) + (T >= L && T <= R) << "\n";
}
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... |