#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b;
ll l[1000005],r[1000005];
vector <pair<ll,ll>> pasang;
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)2e18);
// 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){
pasang.push_back({l[i],r[i]});
// cout<<l[i]<<" "<<r[i]<<endl;
}
else{
pasang.push_back({l[i],t-1});
// cout<<l[i]<<" "<<t-1<<endl;
pasang.push_back({0,r[i]%t});
// cout<<0<<" "<<(u-(t-l[i]))-1<<endl;
}
// cout<<l[i]<<" "<<r[i]<<endl;
}
// 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());
ll ans=0;
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});
ans+=last-previous+1;
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;
}
Compilation message
strange_device.cpp: In function 'int main()':
strange_device.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for (int i=1;i<pasang.size();i++){
| ~^~~~~~~~~~~~~~
strange_device.cpp:11:8: warning: unused variable 'x' [-Wunused-variable]
11 | ll x;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
4 ms |
984 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
321 ms |
47052 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
321 ms |
47052 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
321 ms |
47052 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
33 ms |
6476 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
4 ms |
984 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |