Submission #1312480

#TimeUsernameProblemLanguageResultExecution timeMemory
1312480kawhiet수천개의 섬 (IOI22_islands)C++20
0 / 100
2 ms572 KiB
#include <bits/stdc++.h> #include "islands.h" using namespace std; vector<bool> vis; vector<int> from; vector<vector<int>> g; bool found = 0; int l, r; void dfs(int u, int p) { vis[u] = 1; from[u] = p; for (auto v : g[u]) { if (vis[v]) { found = 1; l = u; r = v; return; } dfs(v, u); if (found) return; } } variant<bool, vector<int>> find_journey(int n, int m, vector<int> _u, vector<int> _v) { g.resize(n); vis.resize(n); from.resize(n); for (int i = 0; i < m; i++) { int u = _u[i], v = _v[i]; g[u].push_back(v); g[v].push_back(u); } for (int i = 0; i < n; i++) { if (!vis[i]) { dfs(i, -1); } } if (!found) { return false; } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...