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>
#include <algorithm>
#include <assert.h>
#include <map>
//#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int n,m;
map<int,vector<int>> c[100005];
vector<int> sol;
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V)
{
n=N;
m=M;
for(int i=0;i<m;i++)
{
int a=U[i],b=V[i];
c[a][b].push_back(i);
}
if(n==2)
{
if(c[0][1].size()>=2&&c[1][0].size()>=1)
{
int A=c[1][0][0];
int B=c[0][1][0];
int C=c[0][1][1];
sol={B,A,C,B,A,C};
return sol;
}
return false;
}
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... |