# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934699 | 2024-02-27T20:06:19 Z | haxorman | Strange Device (APIO19_strange_device) | C++14 | 270 ms | 53108 KB |
#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"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 3 ms | 1116 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 452 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 270 ms | 53108 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 270 ms | 53108 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 270 ms | 53108 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 452 KB | Output is correct |
2 | Incorrect | 34 ms | 5800 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 3 ms | 1116 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |