Submission #696263

#	Time	Username	Problem	Language	Result	Execution time	Memory
696263		T0p_	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	159 ms	22020 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++)
	{
		if (visited[i]) continue ;
		visited[i] = true;

		for (int j=0 ; j<i ; j++) if (p[i][j] == 1 || (p[i][j] == 0 && fp(i) == fp(j))) return 0;

		for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1)
		{
			if (visited[j]) return 0;
			visited[j] = true;

			pa[fp(j)] = fp(i);
			ans[i][j] = ans[j][i] = 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