# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797601 | XJP12 | 수천개의 섬 (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.
vector<int> find_journey(int n, int m, vector<int> u, vector<int> v){
bool ban=false;
int ban1=0;
int a=-1,b=-1,c=-1;
for(int i=0; i<m; i++){
if(u[i]==0){
ban1++;
if(a==-1){
a=i;
}else{
b=i;
}
}else{
ban=true;
c=i;
}
}
vector<int> x(6);
struct ans s;
if(ban==true && ban1>1){
x={a,c,b,a,c,b};
s.bani=true;
s.v=x;
return s.v;
}else{
s.bani=false;
return s.v;
}
}