# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042553 | yanb | Thousands Islands (IOI22_islands) | C++17 | 44 ms | 30900 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>
using namespace std;
//#define int long long
#define pii pair<int, int>
variant<bool, vector<int>> n2(int n, int M, vector<int> U, vector<int> V) {
vector<int> u0, u1;
for (int i = 0; i < M; i++) {
if (U[i]) u1.push_back(i);
else u0.push_back(i);
}
if (u1.size() > 0 && u0.size() > 1) {
vector<int> ans = {u0[0], u1[0], u0[1], u0[0], u1[0], u0[1]};
return ans;
} else {
return false;
}
}
void dfs(int v, int p, vector<vector<pii>> &g, vector<bool> &uu, vector<int> &ps) {
if (uu[v]) return;
uu[v] = 1;
ps[v] = p;
for (auto [u, _] : g[v]) {
dfs(u, v, g, uu, ps);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |