#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;
arr<bool, N> vs;
bool dfs(int u = 1) {
vs[u] = true;
if (adj[u].size() >= 3) return true;
for (auto [v, i] : adj[u])
if (!vs[v] && dfs(v)) return true;
return false;
}
var<bool, vec<int>> find_journey(int _n, int _m, vec<int> _u, vec<int> _v) {
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});
}
if (adj[1].size() >= 2) return true;
return dfs();
}
# | 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... |