Submission #764281

#TimeUsernameProblemLanguageResultExecution timeMemory
764281raysh07수천개의 섬 (IOI22_islands)C++17
9.10 / 100
27 ms7212 KiB
#include "islands.h" #include <variant> #include <bits/stdc++.h> using namespace std; const int N = 1e5 + 69; int deg[N]; bool vis[N]; vector <int> adj[N]; int n; void dfs(int u){ vis[u] = true; for (int v : adj[u]){ if (!vis[v]) dfs(v); } } variant<bool, vector<int>> find_journey(int nn, int m, vector<int> u, vector<int> v) { n = nn; for (int i = 0; i < m; i+=2){ adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); deg[u[i]]++; deg[v[i]]++; } for (int i = 0; i < n; i++){ if (deg[i] >= 3) { dfs(i); } } if (vis[0] || deg[0] >= 2) return true; return false; }
#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...