Submission #1061588

#TimeUsernameProblemLanguageResultExecution timeMemory
1061588jamjanekThousands Islands (IOI22_islands)C++17
1.75 / 100
25 ms7892 KiB
#include "islands.h" #include <variant> #include <vector> #include<bits/stdc++.h> using namespace std; int odw[100010]; vector<pair<int, int>>graf[100010]; void dfs(int x, int kra){ for(auto j: graf[x]){ if(kra!=j.second){ odw[j.first]++; if(odw[j.first]==1) dfs(j.first, j.second); } } } std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V) { int i; for(i=0;i<m;i+=2){ graf[U[i]].push_back({V[i], i}); graf[V[i]].push_back({U[i], i}); } odw[0] = 1; dfs(0, -1); for(i=0;i<n;i++) if(odw[i]>0 && graf[i].size()>1) 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...