# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934698 | haxorman | 이상한 기계 (APIO19_strange_device) | C++14 | 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;
#define int long long
const int mxN = 1e6 + 7;
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
__int128 p = a;
p *= b;
p /= gcd(a, b+1);
int ans = 0;
vector<pair<int,int>> ranges;
for (int i = 0; i < n; ++i) {
int l, r;
cin >> l >> r;
if (r - l + 1 >= p) {
ans = p;
}
if (r < l) {
ranges.push_back({l, p-1});
ranges.push_back({0, r});
}
else {
ranges.push_back({l, r});
}
}
if (ans == p) {
cout << ans << "\n";
exit(0);
}
sort(ranges.begin(), ranges.end());
auto [l, r] = ranges[0];
for (int i = 1; i < ranges.size(); ++i) {
auto [lb, rb] = ranges[i];
if (lb <= r) {
rb = r;
}
else {
ans += r - l + 1;
l = lb, r = rb;
}
}
ans += r - l + 1;
cout << ans << "\n";
}