| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 831190 | caganyanmaz | 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 <bits/stdc++.h>
#define pb push_back
#include "islands.h"
using namespace std;
#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif
constexpr static int MXN = 1e5 + 5;
int n, m;
vector<int> u, v;
vector<array<int, 2>> g[MXN];
int state[MXN];
vector<int> path;
bool dfs(int node)
{
state[node] = 1;
for (auto [c, e] : g[node])
{
path.pb(e);
if (state[c] == 1)
return true;
if (state[c] == 0 && dfs(c))
return true;
path.pop_back();
}
state[node] = 2;
return false;
}
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V)
{
n = N, m = M;
u = U, v = V;
int lcount = 0, rcount = 0;
for (int j = 0; j < m; j++)
if (u[j] == 0)
lcount++;
else
rcount++;
return lcount > 1 && rcount > 0;
}