#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define arr array
#define vec vector
#define var variant
#define pii pair<int, int>
#define fir first
#define sec second
const int N = 1e5 + 5;
int n, m;
arr<vec<pii>, N> adj;
var<bool, vec<int>> find_journey(int _n, int _m, vec<int> _u, vec<int> _v) {
map<pii, int> id;
n = _n, m = _m;
for (int i = 0; i < m; i++) {
int u = _u[i] + 1, v = _v[i] + 1;
adj[u].push_back({v, i});
id[{u, v}] = i;
}
if (n <= 2) return false;
int a = id[{1, 2}], b = id[{2, 1}], c = id[{1, 3}], d = id[{3, 1}];
vec<int> ans = {a, b, c, d, b, a, d, c};
return ans;
}
# | 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... |