제출 #696234

#제출 시각아이디문제언어결과실행 시간메모리
696234T0p_슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
169 ms23940 KiB
// Subtask 2 #include "supertrees.h" #include <bits/stdc++.h> using namespace std; const int N = 1000; bool visited[N]; 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; vector<int> group = {i}; for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1) { visited[j] = true; group.push_back(j); } int sz = group.size(); for (int a=0 ; a<sz ; a++) for (int b=0 ; b<sz ; b++) if (p[group[a]][group[b]] == 0) return 0; for (int a=0 ; a<sz-1 ; a++) ans[group[a]][group[a+1]] = ans[group[a+1]][group[a]] = 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...