#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int n, m;
vector<vi> adj;
vi istate;
variant<bool, vi> find_journey(int N, int M, vi U, vi V) {
n = N; m = M; istate.assign(n, 0); adj.resize(n);
for (int i = 0; i < m; i++) {
adj[U[i]].push_back(i);
adj[V[i]].push_back(i);
}
if (n == 2) return false;
auto find = [&](int u, int v) {
for (int i = 0; i < m; i++) {
if (U[i] == u && V[i] == v) return i;
}
return -1;
};
int a = find(0, 1), b = find(1, 0), c = find(1, 2), d = find(2, 1), e = find(2, 0), f = find(0, 2);
return vector<int>({a, c, e, f, d, b, e, c, a, b, d, f});
}
| # | 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... |