Submission #720118

#	Time	Username	Problem	Language	Result	Execution time	Memory
720118		mseebacher	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	304 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h> 

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> comp(n);
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(p[i][j]){
				comp[i].push_back(j);
			}
		}
	}
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(p[i][j] && comp[i] != comp[j]) return 0;
		}
	}
	
	vector<bool> vis(n,0);
	vector<vector<int>> ans(n,vector<int>(n,0));
	for(int i = 0;i<n;i++){
		if(!vis[i]){
			for(int j = 0;j<(int)comp[i].size();j++){
				ans[i][comp[i][j]] = 1;
				ans[comp[i][j]][i] = 1;
				vis[comp[i][j]] = 1;
			}
		}
	}
	
	build(ans);
	return 1;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4