제출 #696268

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