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>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 510000
int n, q, d[maxn];
void solve() {
cin >> n >> q;
for(int i = 1; i <= n; i++) {
cin >> d[i];
}
for(int i = 2; i <= n; i++) {
d[i] = d[i-1]*((d[i]+d[i-1]-1)/d[i-1]);
}
while(q--) {
int t,l,r;
cin >> t >> l >> r;
int ans = 0;
if(l <= t && t <= r) ans++;
for(int i = 1; i <= n; i++) {
int pos = -i+(t/d[i])*d[i];
if(l <= pos && pos <= r) {
ans++;
}
}
cout << ans << endl;
}
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(0);
// freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
int tt = 1;
// cin >> tt;
while(tt--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |