Submission #696364

#	Time	Username	Problem	Language	Result	Execution time	Memory
696364		T0p_	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	367 ms	22592 KiB

supertrees

// Subtask 2

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1000;

int pa[N];
bool visited[N];

int fp(int u) { return pa[u] = (u == pa[u]) ? u : fp(pa[u]); }

int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n, 0));
	
	for (int i=0 ; i<n ; i++) pa[i] = i;

	for (int i=0 ; i<n ; i++)
	{
		if (visited[i]) continue ;

		vector<int> group = {i};
		for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1) group.push_back(j);

		for (int x : group) for (int y : group) if (p[x][y] != 1) return 0;

		int sz = group.size();
		for (int i=1 ; i<sz ; i++) ans[group[i-1]][group[i]] = ans[group[i]][group[i-1]] = 1;
	}

	build(ans);
	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