# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1212592 | qwusha | Thousands Islands (IOI22_islands) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "islands.h"
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
int inf = 1e9;
#include <variant>
#include <vector>
variant<bool, vector<int>> find_journey( int n, int m, std::vector<int> u, std::vector<int> v) {
vector<int> ze, on;
for (int i = 0; i < m; i++) {
if (u[i] == 0) {
ze.push_back(i);
} else {
on.push_back(i);
}
}
if (ze.size() >= 2 && on.size() >= 1) {
return {ze[0], on[0], ze[1], ze[0], on[0], ze[1]};
}
}