Submission #938937

#TimeUsernameProblemLanguageResultExecution timeMemory
938937AndreibatmanStrange Device (APIO19_strange_device)C++14
0 / 100
396 ms17024 KiB
#include <bits/stdc++.h>
using namespace std;
unsigned long long n,a,b,ans,i,t,k,pozst,lg,schema,ok,st,dr,x;
struct ceva
{
    unsigned long long l,r;
}v[5000010];
bool cmp(ceva a,ceva b)
{
    return a.r<b.r || (a.r==b.r && a.l<b.l);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>a>>b;
    b++;
    x=__gcd(a,b);
    a=a/x;
    if(ULLONG_MAX/b<a)
        k=1e18;
    else
        k=a*b;
    k=k-a;
    for(i=1;i<=n;i++)
    {
        cin>>v[i].l>>v[i].r;
        if(v[i].r-v[i].l+1>=k)
        {
            cout<<k;
            return 0;
        }
        v[i].l%=k;
        v[i].r%=k;
        if(v[i].l<=v[i].r)
            ;
        else
        {
            v[n+(++schema)]={v[i].l,k-1};
            v[i]={0,v[i].r};
        }
    }
    /*if(ok==1)
    {
        cout<<k;
        return 0;
    }*/
    n=n+schema;
    sort(v+1,v+n+1,cmp);
    //for(i=1;i<=n;i++)
    //    cout<<v[i].l<<" "<<v[i].r<<'\n';
    st=0;
    dr=0;
    for(i=1;i<=n;i++)
    {
        st=max(st,v[i].l);
        st=max(st,v[i-1].r+1);
        if(dr==v[i].r)
            continue;
        dr=v[i].r;
        st=max(st,v[i].l);
        st=max(st,v[i-1].r+1);
        ans=ans+dr-st+1;
    }
    cout<<ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...