# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012707 | bachhoangxuan | 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;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
vector<vector<int>> e(N);
for(int i=0;i<M;i++) e[U[i]].push_back(i);
if((int)e[0].size()<2 || (int)e[1].size()<1) return false;
return {e[0][0],e[1][0],e[0][1],e[0][0],e[1][0],e[0][1]};
}