# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654834 | aryan12 | 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;
variant<bool, vector<int> > find_journey(int N, int M, vect or<int> U, vector<int> V)
{
vector<int> c1, c2;
for(int i = 0; i < M; i++)
{
if(U[i] == 0)
{
c1.push_back(i);
}
else
{
c2.push_back(i);
}
}
if(c1.size() < 2 || c2.size() < 1)
{
return false;
}
return vector<int>({c1[0], c2[0], c1[1], c1[0], c2[0], c1[1]});
// if true
return vector<int>({0, 1, 2});
// if false
return false;
}