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 <variant>
#include <vector>
using namespace std;
variant<bool, vector<int>> find_journey(
int N, int M, vector<int> U, vector<int> V) {
vector<int> c0, c1;
for (int i = 0; i < M; i++) {
if (U[i] == 0)
c0.push_back(i);
if (U[i] == 1)
c1.push_back(i);
}
if (c0.size() >= 2 && c1.size() >= 1) {
return vector<int>{
c0[0], c1[0], c0[1],
c0[0], c1[0], c0[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... |