# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963453 | 2024-04-15T03:43:08 Z | Namkhing | Thousands Islands (IOI22_islands) | C++17 | 25 ms | 4436 KB |
#include <bits/stdc++.h> #include "islands.h" using namespace std; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { int first = 0, second = 0; for (int u : U) { if (u) { second++; } else { first++; } } if (first < 2 || second < 1) { return false; } int a, b, c; for (int i = 0; i < M; i++) { if (!U[i]) { a = i; break; } } for (int i = M - 1; i >= 0; i--) { if (!U[i]) { b = i; break; } } for (int i = 0; i < M; i++) { if (U[i]) { c = i; break; } } vector<int> r = {a, c, b, a, c, b}; return r; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 25 ms | 4336 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 348 KB | Output is partially correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Partially correct | 0 ms | 348 KB | Output is partially correct |
4 | Partially correct | 0 ms | 348 KB | Output is partially correct |
5 | Partially correct | 1 ms | 344 KB | Output is partially correct |
6 | Partially correct | 23 ms | 3924 KB | Output is partially correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 348 KB | Output is partially correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 348 KB | Output is partially correct |
2 | Partially correct | 1 ms | 348 KB | Output is partially correct |
3 | Partially correct | 24 ms | 4260 KB | Output is partially correct |
4 | Partially correct | 24 ms | 4436 KB | Output is partially correct |
5 | Partially correct | 1 ms | 484 KB | Output is partially correct |
6 | Partially correct | 2 ms | 348 KB | Output is partially correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Partially correct | 0 ms | 544 KB | Output is partially correct |
9 | Partially correct | 0 ms | 348 KB | Output is partially correct |
10 | Partially correct | 1 ms | 348 KB | Output is partially correct |
11 | Incorrect | 1 ms | 348 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 25 ms | 4336 KB | Output is correct |
8 | Partially correct | 0 ms | 348 KB | Output is partially correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Partially correct | 0 ms | 348 KB | Output is partially correct |
11 | Partially correct | 0 ms | 348 KB | Output is partially correct |
12 | Partially correct | 1 ms | 344 KB | Output is partially correct |
13 | Partially correct | 23 ms | 3924 KB | Output is partially correct |
14 | Partially correct | 1 ms | 348 KB | Output is partially correct |
15 | Correct | 1 ms | 344 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Incorrect | 0 ms | 348 KB | Output isn't correct |
18 | Halted | 0 ms | 0 KB | - |