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;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V)
{
int cnt0 = 0, cnt1 = 0;
vector < int > idx0, idx1;
for (int i = 0; i < M; i ++)
{
if (U[i] == 0)
cnt0 ++, idx0.push_back(i);
else
cnt1 ++, idx1.push_back(i);
}
if (cnt0 >= 2 && cnt1 >= 1)
{ vector < int > path;
path.push_back(idx0[0]);
path.push_back(idx1[0]);
path.push_back(idx0[1]);
path.push_back(idx0[0]);
path.push_back(idx1[0]);
path.push_back(idx0[1]);
return path;
}
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... |