# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034651 | Mr_Husanboy | Thousands Islands (IOI22_islands) | C++17 | 0 ms | 0 KiB |
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 <variant>
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
const int mod = 1000002022;
vector<int> state, p;
int n, m;
vector<vector<int>> g;
template<typename T>
int len(T &a){return a.size();}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
variant<bool, vector<int>> find_journey(
int n, int m, std::vector<int> u, std::vector<int> v) {
vector<vector<int>> g(n);
for(int i = 0; i < m; i ++) g[u[i]].push_back(i);
if(len(g[0]) == 0) return false;
vector<int> ans;
vector<int> vis(n);
vector<int> cyc;
vector<int> par(n);
auto dfs = [&](auto &dfs, int i)->bool{
vis[i] = 1;
int r = 0;
for(auto j : g[i]){
if(j % 2) continue;
int x = v[j];
par[x] = j;
if(vix[x] == 2) continue;
if(vis[x] == 1){
// cyc.push_back(j);
// int cur = i;
// while(cur != x){
// cyc.push_back(par[cur]);
// cur = u[par[cur]];
// }
return true;
}
if(dfs(dfs, x)){
return true;
}
}
vis[i] = 2;
return false;
};
return dfs(dfs, 0);
}