#include <iostream>
#include <algorithm>
#include <vector>
#include "supertrees.h"
using namespace std;
vector<vector<int>> c;
vector<vector<int>> adj;
int n;
int exc(vector<int> a, vector<int> b){
for(int i = 0; i<n; i++){
if(!((a[i] && b[i]) || (!a[i] && !b[i]))) return 0;
}
return 1;
}
int sm(vector<int> a, vector<int> b){
for(int i = 0; i<n; i++){
if(a[i]!=b[i]) return 0;
}
return 1;
}
int construct(vector<vector<int>> c1){
c = c1;
n = c[0].size();
adj.assign(n, vector<int>(n, 0));
for(int i = 0; i<n; i++) c[i].push_back(i);
sort(c.begin(), c.end());
int nodeInCurrConp = 0;
int same = 0;
vector<vector<int>> cycleR;
int ind = 0;
while(ind < n){
cycleR.clear();
cycleR.push_back({c[ind][n]});
int g = 0;
ind++;
while(ind<n && exc(c[ind], c[ind-1])){
if(sm(c[ind], c[ind-1])){
cycleR[g].push_back(c[ind][n]);
}
else{
cycleR.push_back({c[ind][n]});
g++;
}
ind++;
}
for(int i = 0; i<cycleR.size(); i++){
for(int j = 0; j<cycleR[i].size(); j++){
adj[cycleR[i][0]][cycleR[i][j]] = adj[cycleR[i][j]][cycleR[i][0]] = 1;
}
}
for(int i = 0; i<cycleR.size()-1; i++){
adj[cycleR[i][0]][cycleR[i+1][0]] = adj[cycleR[i+1][0]][cycleR[i][0]] = 1;
}
adj[cycleR[cycleR.size()-1][0]][cycleR[0][0]] = adj[cycleR[0][0]][cycleR[cycleR.size()-1][0]] = 1;
}
for(int i = 0; i<n; i++) adj[i][i] = 0;
build(adj);
return 1;
}
// int main(void){
// freopen("input.txt", "r", stdin);
// int n; cin>>n;
// vector<vector<int>> c1;
// c1.assign(n, vector<int>(n, 0));
// for(int i = 0; i<n; i++){
// for(int j = 0; j<n; j++) cin>>c1[i][j];
// }
// construct(c1);
// }
