# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
478393 | ponytail | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] == 3) return 0;
}
}
for(int i=0; i<n; i++) {
dsu[i] = dsu2[i] = i;
}
vector<vector<int> > v(n);
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] == 1) {
if(set_of(i) != set_of(j)) {
union_(i, j);
answer[i][j] = answer[j][i] = 1;
}
}
}
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] != 1 && set_of(i) == set_of(j)) {
return 0;
}
}
}
vector<int> fin;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] == 2 && set_of(i) != set_of(j)) {
union2(set_of(i), set_of(j));
}
}
}
for(int i=0; i<n; i++) {
v[set_of2(i)].push_back(i);
}
for(int i=0; i<n; i++) {
if(v[i].size() == 2) return 0;
}
for(int i=0; i<n; i++) {
if(v[i].size() > 2) {
for(int j=0; j<v[i].size(); j++) {
answer[v[i][j]][v[i][(j+1) % v[i].size()]] = 1;
answer[v[i][(j+1) % v[i].size()]][v[i][j]] = 1;
union_(v[i][j], v[i][(j+1) % v[i].size()]);
}
}
}
build(answer);
return 1;
}