# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076444 | zsombor | 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>
#include <variant>
using namespace std;
int n, m;
vector<int> u;
vector<int> v;
vector<int> ans;
void solve1() {
vector<int> a;
vector<int> b;
for (int i = 0; i < m; i++) {
if (!u[i]) b.push_back(i);
else a.push_back(i);
}
if (a.size() < 2 || b.size() < 2) return;
ans = {a[0], b[0], a[1], b[1], b[0], a[0], b[1], a[1]};
}
variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V) {
n = N;
m = M;
u = U;
v = V;
if (n == 2) solve1();
return (ans.size() ? ans : false);
}