# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782625 | devariaota | Strange Device (APIO19_strange_device) | C++17 | 0 ms | 0 KiB |
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;
typedef long long ll;
ll n,a,b;
ll l[1000005],r[1000005];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>a>>b;
__int128_t t;
ll x;
// if ((b+1)%a==0){
// t=b;
// }
// else{
// t=min((__int128_t)a*(__int128_t)b,(__int128_t)1e18);
// }
t=min((__int128_t)a*(__int128_t)b/gcd(a,b+1),(__int128_t)1e18;)
// cout<<t;
// t=lcm(t,b);
set <pair<ll,ll>> st;
for (int i=1;i<=n;i++){
cin>>l[i]>>r[i];
ll u=r[i]-l[i]+1;
if (u>=t){
l[i]=0;
r[i]=t-1;
}
else{
ll q=r[i]-l[i];
ll p=l[i]%t;
l[i]=p;
r[i]=l[i]+q;
}
if (r[i]<=t-1){
st.insert({l[i],r[i]});
// cout<<l[i]<<" "<<r[i]<<endl;
}
else{
st.insert({l[i],t-1});
// cout<<l[i]<<" "<<t-1<<endl;
st.insert({0,(u-(t-l[i]))-1});
// cout<<0<<" "<<(u-(t-l[i]))-1<<endl;
}
// cout<<l[i]<<" "<<r[i]<<endl;
}
vector <pair<ll,ll>> pasang;
for (auto z:st){
pasang.push_back(z);
}
sort(pasang.begin()+1,pasang.begin()+n+1);
vector <pair<ll,ll>> jawab;
ll last=pasang[0].second,previous=pasang[0].first;
pasang.push_back({(ll)1e18+100,(ll)1e18+100});
sort(pasang.begin(),pasang.end());
for (int i=1;i<pasang.size();i++){
if (pasang[i].first<=last){
last=max(last,pasang[i].second);
}
else{
jawab.push_back({previous,last});
previous=pasang[i].first;
last=max(last,pasang[i].second);
}
}
// if (previous>jawab[jawab.size()-1].second){
// // jawab.push_back({previous,last});
// }
ll ans=0;
for (int i=0;i<jawab.size();i++){
ans+=jawab[i].second-jawab[i].first+1;
// cout<<jawab[i].first<<" "<<jawab[i].second<<":::"<<endl;
}
cout<<" "<<ans;
}