제출 #917147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917147		alexdd	Worst Reporter 3 (JOI18_worst_reporter3)	C++17	100 / 100	490 ms	33272 KiB

worst_reporter3

#include<bits/stdc++.h>
using namespace std;
/*ifstream fin("input.in");
ofstream fout("output.out");
#define cin fin
#define cout fout*/
#define int long long
int n,q;
int d[500005];
int p[500005];
int ultmare[500005];
int calc_cur(int j, int t)
{
    int i = ultmare[j];
    return (-i + (t/p[i]) * p[i]) - (j - i);
}
void calc_p()
{
    int mxm=d[1];
    p[1]=d[1];
    ultmare[1]=1;
    for(int i=2;i<=n;i++)
    {
        if(d[i]>=mxm)
        {
            mxm=((d[i]-1)/mxm + 1)*mxm;
            p[i]=mxm;
            ultmare[i]=i;
        }
        else
        {
            ultmare[i]=ultmare[i-1];
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>d[i];
    calc_p();
    int le,ri,t;
    while(q--)
    {
        cin>>t>>le>>ri;
        int cnt=0;
        if(le<=t && t<=ri)
            cnt++;
        if(calc_cur(n,t)<=ri && calc_cur(1,t)>=le)
        {
            int st,dr,mij,ans=1;
            st=1;
            dr=n;
            while(st<=dr)
            {
                mij=(st+dr)/2;
                if(calc_cur(mij,t)<=ri)
                {
                    ans=mij;
                    dr=mij-1;
                }
                else
                    st=mij+1;
            }
            cnt -= ans;

            ans=n;
            st=1;
            dr=n;
            while(st<=dr)
            {
                mij=(st+dr)/2;
                if(calc_cur(mij,t)>=le)
                {
                    ans=mij;
                    st=mij+1;
                }
                else
                    dr=mij-1;
            }
            cnt += ans + 1;
        }
        cout<<cnt<<"\n";
    }
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 81 / 81