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 int long long
# define vi vector<int>
# define pb push_back
# define pii pair<int, int>
# define fi first
# define se second
# define endl '\n'
# define jess ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, a, b;
void solve() {
cin >> n >> a >> b;
__int128_t t=a*b;
int cycle=t / __gcd(a, b+1);
vector<pii> v;
for(int i=1; i<=n; i++) {
int l, r;
cin >> l >> r;
l%=cycle;
r%=cycle;
if(r < l) {
v.pb({l, cycle-1});
v.pb({0, r});
} else {
v.pb({l, r});
}
}
sort(v.begin(), v.end());
bool st=1;
int l=0, r=1, ans=0;
// for(pii i : v) cout << "l r " << i.fi << " " << i.se << endl;
for(auto i : v) {
if(st) {
l=i.fi, r=i.se;
st=0;
continue;
}
if(i.fi>=l && i.fi<=r) {
r=max(r, i.se);
} else {
ans+=(r-l+1);
l=i.fi, r=i.se;
}
}
ans+=(r-l+1);
cout << ans << endl;
}
signed main() {
jess;
solve();
}
# | 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... |