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) {
if (N == 2) {
vector<int> a, b;
for (int i = 0; i < M; i++) {
if (U[i] == 0) {
a.push_back(i);
} else {
b.push_back(i);
}
}
if (a.size() >= 2 && b.size() >= 1) {
return vector{a[0], b[0], a[1], a[0], b[0], a[1]};
} else {
return false;
}
}
int s[3][3];
for (int i = 0; i < M; i++) {
if (U[i] < 3 && V[i] < 3) {
s[U[i]][V[i]] = i;
}
}
return vector{s[0][1], s[1][2], s[2][0], s[0][2], s[2][1], s[1][0], s[2][0], s[1][2], s[0][1], s[1][0], s[2][1], s[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... |