#include "islands.h"
#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<vector<int>> g(N);
for (int i=0; i<M; i++) g[U[i]].push_back(i);
if (g[0].size() >= 2 && g[1].size() >= 1) return vector<int>({g[0][0], g[1][0], g[0][1], g[0][0], g[1][0], g[0][1]});
return false;
}
vector<vector<int>> g(N, vector<int>(N));
for (int i=0; i<M; i++) g[U[i]][V[i]] = i;
if (N == 2) return false;
return vector<int>({g[0][1], g[1][2], g[2][0], g[0][2], g[2][1], g[1][0], g[2][0], g[1][2], g[0][1], g[1][0], g[2][1], g[0][2]});
}
# | 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... |