# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797645 | XJP12 | Thousands Islands (IOI22_islands) | C++17 | 0 ms | 0 KiB |
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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
variant<bool,vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v){
if(n<3){
return false;
}
int a=-1,b=-1,c=-1,d=-1;
int peanut1=-1, peanut2=-1;
for(int i=0; i<m; i++){
if(u[i]==0){
if(peanut1==-1){
a=i;
peanut1=v[i];
}else{
b=i;
peanut2=v[i];
break;
}
}
}
for(int i=0; i<m; i++){
if(u[i]==peanut1){
if(v[i]==0){
c=i;
break;
}
}
}
for(int i=0; i<m; i++){
if(u[i]==peanut2){
if(v[i]==0){
d=i;
break;
}
}
}
vector<int> x(8);
if(ban==true && ban1>1){
x={a,c,b,d,c,a,d,b};
return x;
}
}