Submission #825733

#TimeUsernameProblemLanguageResultExecution timeMemory
825733ttamxThousands Islands (IOI22_islands)C++17
8.40 / 100
29 ms8696 KiB
#include "islands.h" #include<bits/stdc++.h> using namespace std; const int N=1e5+5; const int M=2e5+5; int n,m; vector<pair<int,int>> adj[N]; vector<int> path; bool vis[N],vis2[N]; int dfs(int u){ if(vis2[u])return u; if(vis[u])return -1; vis[u]=vis2[u]=true; for(auto [v,id]:adj[u]){ path.emplace_back(id); int res=dfs(v); if(res!=-1)return res; path.pop_back(); } vis2[u]=false; return -1; } variant<bool, vector<int>> find_journey(int N,int M,vector<int> U,vector<int> V){ n=N,m=M; for(int i=0;i<m;i+=2)adj[U[i]].emplace_back(V[i],i); int res=dfs(0); if(res==-1)return false; return true; }
#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...