# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064232 | MarwenElarbi | 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;
#define pb push_back
#define ll long long
#define fi first
#define se second
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
vector<int> a;
vector<int> b;
for (int i = 0; i < M; ++i)
{
(U[i]==0 ? a : b).pb(i);
}
if(a.size()>=2&&b.size()>=2){
return {a[0],b[0],a[1],b[1],b[0],a[0],b[1],a[1]};
}
else return false;
}