# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105480 | 2024-10-26T13:49:59 Z | borisAngelov | Strange Device (APIO19_strange_device) | C++17 | 197 ms | 336 KB |
#include <bits/stdc++.h> using namespace std; const long long MAXMOD = 1e18 + 7; int n; long long a, b; void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { fastIO(); cin >> n >> a >> b; long long MOD = a / __gcd(a, b + 1); bool hasPeriod = true; if (MAXMOD / MOD > b) { hasPeriod = false; } else { MOD *= b; // a * b / gcd(a, b + 1) } vector<pair<long long, long long>> intervals; long long ans = 0; bool all = false; for (int i = 1; i <= n; ++i) { long long l, r; cin >> l >> r; if (hasPeriod == false) { ans += (r - l + 1); } else { long long newL = l % MOD; long long newR = r % MOD; if (l / MOD == r / MOD) { intervals.push_back({newL, newR}); } else if (l / MOD + 1 == r / MOD && newL > newR) { intervals.push_back({newL, MOD - 1}); intervals.push_back({0, newR}); } else { all = true; ans = MOD; } } } if (hasPeriod == false) { cout << ans << endl; return 0; } if (all == true) { cout << ans << endl; return 0; } sort(intervals.begin(), intervals.end()); long long from = intervals[0].first, to = intervals[0].second; for (int i = 1; i < intervals.size(); ++i) { if (intervals[i].first <= to) { to = intervals[i].second; } else { ans += (to - from + 1); from = intervals[i].first; to = intervals[i].second; } } ans += (to - from + 1); cout << ans << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 3 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 1 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 1 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 197 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 197 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 197 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 20 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 3 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |