# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797560 | 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.
union(bool, int[]) find_journey(int n, int m, int[] u, int[] v){
bool ban=false;
int ban1=0;
for(int i=0; i<m; i++){
if(u[i]==0){
ban1++;
}else{
ban=true;
}
}
int a[7];
return {ban, a};
if(ban==false && ban1>1){
a={0,1,0,1,0,1,0};
//return make_pair(true,a);
}else{
// return make_pair(false,a);
}
}