이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "bits/stdc++.h"
using namespace std;
#define int int64_t
#define pb push_back
using lint=__int128_t;
const int lim=200100;
const int mod=1e9+7;
using pii=pair<int,int>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Local
freopen(".in","r",stdin);freopen(".out","w",stdout);
#endif
int n,a,b;
cin>>n>>a>>b;
lint cntofdif;
if((b+1)%a==0){
cntofdif=b;
}else{
cntofdif=a/__gcd(a,(b+1));
cntofdif*=b;
cntofdif=min<lint>(cntofdif,int(2e18));
}
int all=cntofdif;
vector<pii>ranges;
for(int i=0;i<n;i++){
int l,r;
cin>>l>>r;
if(all<=r-l+1){
cout<<all;
return 0;
}
l%=all;
r%=all;
if(l<=r){
ranges.pb({l,r});
//cerr<<"inserted "<<l<<" "<<r<<"\n";
}
else{
//cerr<<"oops "<<l<<" "<<r<<"\n";
ranges.pb({l,all-1});
ranges.pb({0,r});
}
}
sort(ranges.begin(),ranges.end());
int cnt=0,left=-1;
for(auto[f,s]:ranges){
if(left<f){
cnt+=s-f+1;
}else{
cnt+=s-left;
}
left=max(left,s);
}
cout<<cnt<<"\n";
}
# | 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... |