| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1315605 | PlayVoltz | 수천개의 섬 (IOI22_islands) | C++20 | 0 ms | 0 KiB |
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second
variant<bool, vector<int> > find_journey(int n, int m, vector<int> u, vector<int> v){
if (m<3)break;
vector<int> a, b;
for (int i=0; i<m; ++i){
if (v[i])a.pb(i);
else b.pb(i);
}
if (a.empty()||b.empty())return 0;
if (a.size()>=2)return {a[0], b[0], a[1], a[0], b[0], a[1]};
return 0;
}
