# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378155 | 2021-03-16T05:34:59 Z | JerryLiu06 | Strange Device (APIO19_strange_device) | C++11 | 802 ms | 69272 KB |
#include <bits/stdc++.h> #include <iostream> using namespace std; typedef long long ll; typedef pair<ll, int> pli; #define f first #define s second int N; ll A, B, ans = 0; vector<pli> E; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> N >> A >> B; ll MOD = A * B; if (MOD < 0) MOD = 1 << 60; for (int i = 0; i < N; i++) { ll X, Y; cin >> X >> Y; X %= MOD; Y %= MOD; if (X <= Y) { E.push_back({X, 1}); E.push_back({Y, -1}); } else { E.push_back({0, 1}); E.push_back({Y, -1}); E.push_back({X, 1}); E.push_back({MOD - 1, -1}); } } sort(begin(E), end(E)); int prev = 0; int cur = 0; ll PREV = 0; ll NOW = 0; for (int i = 0; i < E.size(); ) { ll NOW = E[i].f; while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++; if (prev > 0) ans += E[i - 1].f - PREV - 1; prev = cur; PREV = NOW; } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 6 ms | 1392 KB | Output is correct |
3 | Correct | 6 ms | 1392 KB | Output is correct |
4 | Incorrect | 1 ms | 364 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 420 ms | 57240 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 512 KB | Output is correct |
2 | Correct | 632 ms | 69012 KB | Output is correct |
3 | Incorrect | 571 ms | 69036 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 512 KB | Output is correct |
2 | Correct | 632 ms | 69012 KB | Output is correct |
3 | Incorrect | 571 ms | 69036 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 512 KB | Output is correct |
2 | Correct | 632 ms | 69012 KB | Output is correct |
3 | Incorrect | 571 ms | 69036 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 68 ms | 7392 KB | Output is correct |
3 | Correct | 63 ms | 7516 KB | Output is correct |
4 | Correct | 802 ms | 69120 KB | Output is correct |
5 | Correct | 63 ms | 7396 KB | Output is correct |
6 | Correct | 63 ms | 7392 KB | Output is correct |
7 | Correct | 63 ms | 7532 KB | Output is correct |
8 | Correct | 64 ms | 7516 KB | Output is correct |
9 | Correct | 61 ms | 7392 KB | Output is correct |
10 | Correct | 65 ms | 7392 KB | Output is correct |
11 | Correct | 65 ms | 7392 KB | Output is correct |
12 | Correct | 61 ms | 7700 KB | Output is correct |
13 | Correct | 65 ms | 7408 KB | Output is correct |
14 | Correct | 695 ms | 69272 KB | Output is correct |
15 | Incorrect | 65 ms | 7392 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 6 ms | 1392 KB | Output is correct |
3 | Correct | 6 ms | 1392 KB | Output is correct |
4 | Incorrect | 1 ms | 364 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |