# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378172 | 2021-03-16T06:15:06 Z | JerryLiu06 | Strange Device (APIO19_strange_device) | C++11 | 577 ms | 33340 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 > 1000000000000000000L) MOD = 1000000000000000010L; 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(); ) { NOW = E[i].f; while (i < E.size() && E[i].f == NOW) cur += E[i++].s; if (prev > 0) ans += NOW - PREV; prev = cur; PREV = NOW; } cout << ans + 1 << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 6 ms | 1008 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 | 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 | 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 | Incorrect | 577 ms | 33340 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 | Incorrect | 577 ms | 33340 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 | Incorrect | 577 ms | 33340 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 | Incorrect | 63 ms | 4716 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 | Incorrect | 6 ms | 1008 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |