# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1149580 | byunjaewoo | Thousands Islands (IOI22_islands) | C++20 | 19 ms | 3144 KiB |
#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
if(N<3) return false;
int a=0, b=0, c=0, d=0;
for(int i=0; i<M; i++) {
if(U[i]==0 && V[i]==1) a=i;
else if(U[i]==0 && V[i]==2) b=i;
else if(U[i]==1 && V[i]==0) c=i;
else if(U[i]==2 && V[i]==0) d=i;
}
vector<int> ret;
for(int i=0; i<2; i++) ret.push_back(a), ret.push_back(c), ret.push_back(b), ret.push_back(d);
return ret;
}
# | 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... |