이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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) {
if(N==2) {
vector<int>atob,btoa;
for(int i=0;i<M;i++)
(U[i]?btoa:atob).push_back(i);
if(atob.size()<2||btoa.empty())
return false;
vector<int>v;
v.push_back(atob[0]);
v.push_back(btoa[0]);
v.push_back(atob[1]);
v.push_back(atob[0]);
v.push_back(btoa[0]);
v.push_back(atob[1]);
return v;
} else {
int go[3][3]{};
for(int i=0;i<M;i++)
if(U[i]<3&&V[i]<3)
go[U[i]][V[i]]=i;
vector<int>v;
v.push_back(go[0][1]);
v.push_back(go[1][0]);
v.push_back(go[0][2]);
v.push_back(go[2][0]);
v.push_back(go[1][0]);
v.push_back(go[0][1]);
v.push_back(go[2][0]);
v.push_back(go[0][2]);
return v;
}
}
# | 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... |