Submission #1042486

#TimeUsernameProblemLanguageResultExecution timeMemory
1042486Alihan_8Thousands Islands (IOI22_islands)C++17
9.10 / 100
19 ms4180 KiB
#include "islands.h" #include <variant> #include <vector> #include <bits/stdc++.h> using namespace std; #define pb push_back std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) { int n = N, m = M; // subtask #3 vector <vector<int>> adj(n); for ( int i = 0; i < m; i++ ){ adj[U[i]].pb(V[i]); } bool has = false; vector <int> us(n); auto dfs = [&](auto dfs, int u, int p) -> void{ bool vis = false; us[u] = 1; int child = 0; for ( auto &v: adj[u] ){ if ( v == p && !vis ){ vis = true; continue; } if ( !us[v] ){ dfs(dfs, v, u); child += 1; } else has = true; } if ( child > 1 ) has = 1; }; dfs(dfs, 0, -1); return has; }
#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...