# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527463 | LucaDantas | Strange Device (APIO19_strange_device) | C++17 | 526 ms | 23732 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;
constexpr long long inf = 0x3f3f3f3f3f3f3f3f;
int main() {
long long n, A, B; scanf("%lld %lld %lld", &n, &A, &B);
long long g = __gcd(A, B+1), sz = 0;
if(log(A) + log(B) - log(g) > log(inf)) sz = inf;
else sz = (A/g) * B;
vector<pair<long long, long long>> pares;
long long ini = 0, fim = -1, ans = 0;
for(int i = 0; i < n; i++) {
long long l, r; scanf("%lld %lld", &l, &r);
if(r - l + 1 >= sz) return printf("%lld\n", sz), 0;
l %= sz, r %= sz;
if(r < l) fim = max(fim, r), pares.push_back({l, sz-1});
else pares.push_back({l, r});
}
sort(pares.begin(), pares.end());
for(auto p : pares) {
if(p.first > fim) ans += fim - ini+1, ini = p.first, fim = p.second;
else fim = max(fim, p.second);
}
printf("%lld\n", ans + fim - ini + 1);
}
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... |