# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874158 | 2023-11-16T11:22:07 Z | LucaLucaM | Passport (JOI23_passport) | C++17 | 25 ms | 5212 KB |
#include <iostream> #include <vector> #include <algorithm> #include <cassert> #include <cstring> #warning That's the baby, that's not my baby typedef long long ll; struct Country { int l, r; }; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); int n; std::cin >> n; std::vector<Country> v(n + 1); int rMax[n + 1] = {}; for (int i = 1; i <= n; i++) { std::cin >> v[i].l >> v[i].r; rMax[i] = std::max(rMax[i - 1], v[i].r); } int q; std::cin >> q; while (q--) { int x; std::cin >> x; if (x == 1) { int answer = 0; while (x != n && rMax[x] > x) { x = rMax[x]; answer++; } if (x != n) { answer = -1; } std::cout << answer << '\n'; } } return 0; }
Compilation message
# | 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 | 25 ms | 5156 KB | Output is correct |
5 | Correct | 24 ms | 5208 KB | Output is correct |
6 | Correct | 25 ms | 5212 KB | Output is correct |
7 | Correct | 20 ms | 4444 KB | Output is correct |
8 | Correct | 18 ms | 3676 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 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 | 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 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 25 ms | 5156 KB | Output is correct |
5 | Correct | 24 ms | 5208 KB | Output is correct |
6 | Correct | 25 ms | 5212 KB | Output is correct |
7 | Correct | 20 ms | 4444 KB | Output is correct |
8 | Correct | 18 ms | 3676 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Incorrect | 1 ms | 348 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |