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 <variant>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
variant<bool, vector<int>> find_journey(
int N, int M, vector<int> U, vector<int> V) {
    {
        if (N == 2)
        {
            vector<int>a;
            vector<int>b;
            for (int i = 0; i < M; i++)
                if (U[i] == 0 && V[i] == 1)
                    a.push_back(i);
                else
                    b.push_back(i);
            if (a.size() >= 2 && b.size() >= 1)
                return vector<int>({a[0], b[0], a[1], a[0], b[0], a[1]});
            return false;
        }
    }
    return false;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |