| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312472 | kawhiet | 수천개의 섬 (IOI22_islands) | C++20 | 1 ms | 572 KiB |
#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) {
vector<int> d(n);
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
d[u[i]]++;
g[u[i]].push_back(i);
}
if (d[0] <= 1 || d[1] == 0) {
return false;
}
int x = g[0][0], y = g[0][1], z = g[1][0];
return vector<int>{x, z, y, x, z, y};
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
