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