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;
int n;
vector<int> edge[2];
variant<bool, vector<int>> find_journey(int _n, int m, vector<int> u, vector<int> v) {
n = _n;
for (int i = 0; i < m; i++)
edge[u[i]].push_back(i);
if ((int)edge[0].size() < 2 || (int)edge[1].size() < 1)
return false;
return vector<int>({edge[0][0],edge[1][0],edge[0][1],edge[0][0],edge[1][0],edge[0][1]});
}
# | 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... |