This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e3+5;
int ans, vs[nx];
vector<int> d[nx];
void dfs(int u, int p)
{
vs[u]=1;
if (d[u].size()-(u!=p)>=2) ans=1;
for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u);
}
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
for (int i=0; i<M; i+=2) d[U[i]].push_back(V[i]), d[V[i]].push_back(U[i]);
dfs(0, 0);
if (ans) return vector<int> {};
return false;
}
# | 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... |