| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 411066 | eagle30 | 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 visited[2000];
vector<vector<int> > adjlist;
int coun=1;
void dfs(int s){
	visited[s]=coun;
	for(int i=0; i<adjlist[s].size(); i++){
		int v=adjlist[s][i];
		if(visited[v]==0)
			dfs(v);
	}
}
int construct(vector<vector<int> > p) {
	int n = p.size();
	adjlist.assign(n+1, vector<int>());
	for(int i=0; i<n; i++){		
		for(int j=0; j<n; j++){
			if(p[i][j]){
				adjlist[i].push_back(j);
				adjlist[j].push_back(i);
			}
		}
	}
	for(int i=0; i<n; i++){
		if(visited[i]==0){
			dfs(i);
			coun++;
		}
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(visited[i]==visited[j] && p[i][j]==0)
				return 0;
		}
	}
	vector<vector<int> > answer;
	answer.assign(n, vector<int>());
	for(int i=0; i<n; i++)
		answer[i].assign(n, 0);
	map<int, vector<int> > mp;
	for(int i=0; i<n; i++)
		mp[visited[i]].push_back(i);
	for(auto x:mp){
		for(int i=1; i<x.second.size(); i++){
			answer[x.second[i-1]][x.second[i]]=1;
			answer[x.second[i]][x.second[i-1]]=1;
		}
		if(k==2 && x.size()>1){
			answer[0][x.second[x.second.size()-1]]=1;
			answer[x.second[x.second.size()-1]][0]=1;
		}
	}
	build(answer);
	return 1;
}
