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>
#define endl '\n'
using namespace std;
const int MAXN=5e5+5;
const int MAXQ=5e5+5;
int n,q;
int v[MAXN];
int getPos(int ind,int t)
{
//if(ind<1 || n<ind) ind=1;
return (t/v[ind])*v[ind]-ind;
}
int bs(int x,int t)
{
int l=0,r=n;
while(l<r)
{
int mid=(l+r+1)/2;
if(getPos(mid,t)>=x) l=mid;
else r=mid-1;
}
return l;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>q;
for(int i=1;i<=n;i++) cin>>v[i];
for(int i=2;i<=n;i++)
{
v[i]=((v[i]+v[i-1]-1)/v[i-1])*v[i-1];
if(v[i]==0) v[i]=1;
}
for(int i=0;i<q;i++)
{
int t,l,r;
cin>>t>>l>>r;
int ind1=bs(r+1,t);
int ind2=bs(l,t);
int ans=0;
if(l<=t && t<=r) ans++;
ans+=ind2-ind1;
cout<<ans<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |