Submission #1240163

#TimeUsernameProblemLanguageResultExecution timeMemory
1240163MarwenElarbiThousands Islands (IOI22_islands)C++17
0 / 100
18 ms4164 KiB
#include <bits/stdc++.h> #include "islands.h" using namespace std; #define fi first #define se second #define pb push_back mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<pair<int,int>> adj[1005]; bool vis[1005]; vector<int> ans; bool dfs(int x){ vis[x]=1; bool test=false; for(auto u:adj[x]){ if(vis[u.fi]==1) return true; else if(vis[u.fi]==2) continue; test|=dfs(u.fi); } vis[x]=2; return test; } 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) { if(i%2==0) adj[U[i]].push_back({V[i],i}); } if(dfs(0)) 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...