# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728559 | grogu | 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"
#define dbg(x) cerr<<#x<<": "<<x<<endl
#include <bits/stdc++.h>
#define ll int
#define pll pair<ll,ll>
#include <vector>
#include <variant>
using namespace std;
#define maxn 405
ll n,m;
vector<ll> g[maxn];
ll id[maxn][maxn];
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
return n&1;
n = N;
m = M;
for(ll i = 0;i<m;i++){
ll x = U[i],y = V[i];
x++; y++;
g[x].pb(y);
g[y].pb(x);
id[x][y] = i;
}
for(ll i = 0;i<(n-1)/2;i++){
dfs()
}
}