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 <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long,long long>> seg;
int main(){
long long n,a,b;
cin>>n>>a>>b;
a/=__gcd(a,b+1);
long long mx = 1e18;
if(mx/a<=b){
mx = 1e18;
}else{
mx = a*b;
}
for(int i=0;i<n;i++){
long long l,r;
cin>>l>>r;
if(r-l+1>=mx){
cout<<mx<<endl;
return 0;
}
l%=mx;
r%=mx;
if(l<=r){
seg.push_back(make_pair(l,r));
}else{
seg.push_back(make_pair(l,mx-1));
seg.push_back(make_pair(0,r));
}
}
sort(seg.begin(),seg.end());
long long ans = 0;
long long l = seg[0].first;
long long r = seg[0].second;
for(auto x:seg){
if(r<x.first){
ans+=r-l+1;
l=x.first;
r=x.second;
}else{
r= max(r,x.second);
}
}
ans+=(r-l+1);
cout<<ans<<endl;
}
# | 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... |