# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837234 | Sohsoh84 | 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int deg[MAXN], n, m;
vector<int> f[MAXN];
variant<bool, vector<int>> find_journey(int n_, int m_, vector<int> U_, vector<int> V_) {
n = n_;
m = m_;
for (int i = 0; i < m; i++) deg[U_[i]]++, f[MAXN];
if (deg[0] >= 2 && deg[1] >= 1) return {f[0][0], f[1][0], f[0][1], f[0][0], f[1][0], f[0][1]};
return false;
}