제출 #696250

#제출 시각아이디문제언어결과실행 시간메모리
696250T0p_슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
164 ms22036 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++) pa[i] = i; for (int i=0 ; i<n ; i++) { if (!visited[i]) { visited[i] = true; for (int j=0 ; j<i ; j++) if(p[i][j] == 1) return 0; for (int prv = i, cur = i+1 ; cur<n ; cur++) if (p[i][cur] == 1) { if (visited[cur]) return 0; visited[cur] = true; ans[prv][cur] = ans[cur][prv] = 1; pa[fp(cur)] = fp(prv); prv = cur; } } 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...