# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797671 | Joshi503 | 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){
vector<int> ida, regreso;
for(int i = 0; i < M; i++){
if(U[i] == 0 && V[i] == 1) ida.push_back(i);
else regreso.push_back(i);
}
vector<int> x;
if((int)ida.size() >= 2 && (int)(regreso.size())){
x = {ida[0], regreso[0], ida[1], ida[0], regreso[0], ida[1]};
return x;
}
return 0;
}