Submission #830672

#TimeUsernameProblemLanguageResultExecution timeMemory
830672FatihSolakThousands Islands (IOI22_islands)C++17
9.10 / 100
112 ms27284 KiB
#include "islands.h" #include <bits/stdc++.h> #define N 100005 using namespace std; vector<pair<int,pair<int,int>>> adj[N]; map<int,vector<int>> mp[N]; int par[N]; int vis[N]; int st = -1; int nd = -1; vector<int> ans; void dfs(int v,int pr){ vis[v] = 1; vector<pair<int,pair<int,int>>> tmp; for(auto u:adj[v]){ if(st != -1) return; if(u.second.second == pr) continue; if(vis[u.first] == 2) continue; tmp.push_back(u); } if(tmp.size() > 1) st = 1; else{ for(auto u:adj[v]){ if(st != -1) return; if(vis[u.first]) continue; par[u.first] = u.second.first; dfs(u.first,u.second.first); } } vis[v] = 2; } variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V){ for(int i = 0;i<m;i++){ if(mp[V[i]][U[i]].size()){ adj[U[i]].push_back({V[i],{i,mp[V[i]][U[i]].back()}}); adj[V[i]].push_back({U[i],{mp[V[i]][U[i]].back(),i}}); mp[V[i]][U[i]].pop_back(); }else{ mp[U[i]][V[i]].push_back(i); } } dfs(0,-1); if(st == -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...