| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1230422 | madamadam3 | 수천개의 섬 (IOI22_islands) | C++20 | 20 ms | 6000 KiB |
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int n, m;
vi x, y;
variant<bool, vi> find_journey(int N, int M, vi U, vi V) {
n = N; m = M;
x = U; y = V;
vi z01, z10;
for (int i = 0; i < m; i++) {
if (x[i] == 0 && y[i] == 1) z01.push_back(i);
else if (x[i] == 1 && y[i] == 0) z10.push_back(i);
}
if (z01.size() < 2 || z10.size() < 1) return false;
return vi({z01[0], z10[0], z01[1], z01[0], z10[0], z01[1]});
}
| # | 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... | ||||
