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>
#define fi first
#define se second
#define pb push_back
#define int long long
#define ll long long
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const ll INF = 1e18;
int n, a, b;
int F, K, P;
vector <pii> vec;
int ans;
signed main() {
cin >> n >> a >> b;
b++;
F = __gcd(a, b);
a /= F;
if (INF/b < a) K = INF;
else K = a * b;
P = K - a;
for(int i=1; i<=n; i++){
int l, r; cin >> l >> r;
if(r-l+1 >= P){
cout << P << '\n'; exit(0);
}
l %= P; r %= P;
if(l<=r){
vec.pb({l, r});
} else {
vec.pb({l, P-1});
vec.pb({0, r});
}
}
sort(vec.begin(), vec.end());
int las = -1, ans = 0;
for(auto in : vec){
if(in.se <= las) continue;
ans += in.se - max(in.fi-1, las);
las = in.se;
}
cout << ans << '\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... |