Submission #696244

#TimeUsernameProblemLanguageResultExecution timeMemory
696244T0p_Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
206 ms22040 KiB
// Subtask 2 #include "supertrees.h" #include <bits/stdc++.h> using namespace std; const int N = 1000; int pa[N]; bool visited[N]; int fp(int u) { return pa[u] = (u == pa[u]) ? u : fp(pa[u]); } int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int> (n, 0)); for (int i=0 ; i<n ; i++) { if (!visited[i]) { visited[i] = true; for (int j=0 ; j<n ; j++) if (i != j && p[i][j] == 1) { if (visited[j]) return 0; visited[j] = true; ans[i][j] = ans[j][i] = 1; pa[fp(j)] = fp(i); } } else { for (int j=0 ; j<n ; j++) if (p[i][j] == 1 && fp(i) != fp(j)) return 0; } } build(ans); return 1; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...