Submission #1061411

#TimeUsernameProblemLanguageResultExecution timeMemory
1061411jamjanekThousands Islands (IOI22_islands)C++17
0 / 100
24 ms7296 KiB
#include "islands.h" #include <variant> #include <vector> #include<bits/stdc++.h> using namespace std; int odw[100010]; vector<int>graf[100010]; void dfs(int x){ for(auto j: graf[x]){ odw[j]++; if(odw[j]==1) dfs(j); } } 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]); } odw[0] = 1; dfs(0); for(i=0;i<n;i++) if(odw[i]>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...