| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 637171 | Fidan | 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>
#include <variant>
#include "circuit.h"
using namespace std;
typedef long long ll;
const ll mod=1000002022;
variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v){
if(n==2){
a=-1, b=-1, c=-1;
for(i=0; i<m; i++){
if(u[i]==0){
if(a==-1) a=i;
else b=i;
}
else c=i;
}
if(b==-1 || c==-1) return false;
return vector<int>({a, c, b, a, c, b});
}
return false;
}