제출 #1183758

#제출 시각아이디문제언어결과실행 시간메모리
1183758gygThousands Islands (IOI22_islands)C++20
9.10 / 100
21 ms7748 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; #define arr array #define vec vector #define var variant #define pii pair<int, int> #define fir first #define sec second const int N = 1e5 + 5; int n, m; arr<vec<pii>, N> adj; arr<bool, N> vs; bool dfs(int u = 1) { vs[u] = true; if (adj[u].size() >= 3) return true; for (auto [v, i] : adj[u]) if (!vs[v] && dfs(v)) return true; return false; } var<bool, vec<int>> find_journey(int _n, int _m, vec<int> _u, vec<int> _v) { n = _n, m = _m; for (int i = 0; i < m; i++) { int u = _u[i] + 1, v = _v[i] + 1; adj[u].push_back({v, i}); } if (adj[1].size() >= 2) return true; return dfs(); }
#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...