제출 #696364

#제출 시각아이디문제언어결과실행 시간메모리
696364T0p_슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
367 ms22592 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]) continue ; vector<int> group = {i}; for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1) group.push_back(j); for (int x : group) for (int y : group) if (p[x][y] != 1) return 0; int sz = group.size(); for (int i=1 ; i<sz ; i++) ans[group[i-1]][group[i]] = ans[group[i]][group[i-1]] = 1; } 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...