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;
#define pll pair<ll,ll>
#define fs first
#define sc second
#define ll long long
ll N,A,B;
ll cyc;
vector<pll> v;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N>>A>>B;
cyc = (A&1?A:A>>1);
for(int i = 0;i<N;i++){
ll l,r;
cin>>l>>r;
if(r-l+1>=cyc)v.push_back(pll(0,cyc-1));
else{
if(l%cyc>r%cyc){
v.push_back(pll(l%cyc,cyc-1));
v.push_back(pll(0,r%cyc));
}
else{
v.push_back(pll(l%cyc,r%cyc));
}
}
}
sort(v.begin(),v.end());
ll ans = 0,rp = 0;
for(auto &i:v){
if(rp<i.fs){
ans += i.sc-i.fs+1;
rp = i.sc+1;
}
else{
ans += max(0ll,i.sc-rp+1);
rp = max(rp,i.sc+1);
}
}
cout<<ans<<'\n';
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... |