#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)
{
vector<int> can[n];
for (int i=0;i<m;i++)
can[U[i]].push_back(i);
if (can[0].size()>1 && can[1].size())
return vector<int>({can[0][0],can[1][0],can[0][1],can[0][0],can[1][0],can[0][1]});
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... |