Submission #1037520

#TimeUsernameProblemLanguageResultExecution timeMemory
103752012345678수천개의 섬 (IOI22_islands)C++17
9.10 / 100
23 ms4952 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; const int nx=1e3+5; int ans, vs[nx]; vector<int> d[nx]; void dfs(int u, int p) { vs[u]=1; if (d[u].size()-(u!=p)>=2) ans=1; for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u); } std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { for (int i=0; i<M; i+=2) d[U[i]].push_back(V[i]), d[V[i]].push_back(U[i]); dfs(0, 0); if (ans) return vector<int> {}; 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...