Submission #603671

#	Time	Username	Problem	Language	Result	Execution time	Memory
603671		HamletPetrosyan	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	173 ms	21980 KiB

supertrees

#include "supertrees.h"
#include <vector>
using namespace std;

#define add push_back
#define len(a) ((int)(a).size())

int construct(vector<vector<int>> p) {
	vector<vector<int>> answer(len(p));
	vector<int> h(len(p));
	vector<int> v[1005];

	int now = 0;
	for(int i = 0; i < len(p); i++){
		answer[i].resize(len(p));
		for(int j = 0; j < i; j++){
			if(p[i][j] != 0){
				h[i] = h[j];
				break;
			}
		}
		if(h[i] == 0){
			h[i] = ++now;
		}
		v[h[i]].add(i);
	}

	for(int i = 0; i < len(p); i++){
		for(int j = i + 1; j < len(p); j++){
			if(p[i][j] != 0 && h[i] != h[j]){
				return 0;
			}
		}
	}

	for(int i = 1; i <= now; i++){
		for(int j = 1; j < len(v[now]); j++){
			answer[v[now][j]][v[now][j - 1]] = answer[v[now][j - 1]][v[now][j]] = 1;
		}
	}

	build(answer);
	return 1;
}

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