# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721510 | GrandTiger1729 | Strange Device (APIO19_strange_device) | C++17 | 375 ms | 16812 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;
const int INF = 1e18 + 10;
int main(){
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
long long A, B; cin >> A >> B;
if ((__int128_t)1 * A * B / __gcd(A, B + 1) >= INF){
long long ans = 0;
for (int i = 0; i < n; i++){
long long l, r; cin >> l >> r;
ans += r - l + 1;
}
cout << ans << '\n';
return 0;
}
long long D = (__int128_t)1 * A * B / __gcd(A, B + 1);
vector<pair<long long, long long>> res;
for (int i = 0; i < n; i++){
long long l, r; cin >> l >> r;
r++;
if (r - l >= D){
cout << D << '\n';
return 0;
}
long long ll = D * (l / D + bool(l % D)), rr = D * (r / D);
if (ll > rr){
res.emplace_back(l, r);
}else{
res.emplace_back(l % D, D);
res.emplace_back(0, r);
}
}
long long ans = 0;
for (int i = 0; i < res.size(); i++)
ans += res[i].second - res[i].first;
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | 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... |