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;
long long lim;
int n;
long long a,b;
vector<pair<long long,long long>>vec;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
cin>>a>>b;
long long v=a/__gcd(a,b+1);
if(v<=2e18/b)lim=v*b;
else lim=2e18;
for(int i=1;i<=n;i++)
{
long long l,r;cin>>l>>r;
l=l%lim;r=r%lim;
if(l<=r)vec.push_back({l,r});
else {vec.push_back({0,r});vec.push_back({l,lim-1});}
}
sort(vec.begin(),vec.end());
long long dem=0;
long long r=-2,l=-1;
for(auto v:vec)
{
if(r<v.first){dem+=r-l+1;l=v.first;r=v.second;}
else
r=max(r,v.second);
}
dem+=r-l+1;
cout<<dem;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |