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], l;
void dfs(int u)
{
vs[u]=1;
l.push_back(u);
for (auto v:d[u]) if (!vs[v]) dfs(v);
}
void dfs2(int u, int rt)
{
vs[u]=1;
for (auto v:d[u])
{
if (v==rt) ans=1;
if (vs[v]) continue;
else dfs2(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)
{
bool f=0;
for (auto x:d[U[i]]) if (x==V[i]) f=1;
if (!f) d[U[i]].push_back(V[i]);
}
dfs(0);
for (auto x:l)
{
if (!ans)
{
for (int i=0; i<N; i++) vs[i]=0;
dfs2(x, x);
}
}
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... |