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, vector<int> U, vector<int> V) {
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) {
int X = G[0][0];
int Y = G[0][1];
int Z = G[1][0];
return vector<int>({X, Z, Y, X, Z, Y});
} else {
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... |