제출 #1235615

#제출 시각아이디문제언어결과실행 시간메모리
1235615Ghulam_Junaid수천개의 섬 (IOI22_islands)C++20
1.75 / 100
1094 ms7536 KiB
#include <bits/stdc++.h> #include "islands.h" // #include "grader.cpp" using namespace std; const int N = 1e5 + 10; int n, m, out[N], good[N], bad[N], vis[N]; vector<int> g[N], V; bool dfs(int v, int day){ if (v == 0) return 1; vis[v] = day; bool ans = 0; for (int e : g[v]){ int u = V[e]; if (vis[u] == day) return 1; ans |= dfs(u, day); } return ans; } variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> vv) { V = vv; n = N, m = M; for (int i = 0; i < m; i ++){ g[U[i]].push_back(i); out[U[i]]++; } int day = 0, ans = 0; for (int e : g[0]){ day++; ans += dfs(V[e], day); } return (ans >= 2); if (N == 4) { return vector<int>({0, 1, 2, 4, 0, 3, 2, 1, 4, 3}); } 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...