Submission #696247

#	Time	Username	Problem	Language	Result	Execution time	Memory
696247		T0p_	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	180 ms	22056 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])
		{
			visited[i] = true;
			int prv = i;
			for (int cur = i+1 ; cur<n ; cur++) if (p[i][cur] == 1)
			{
				if (visited[cur]) return 0;

				visited[cur] = true;
				ans[prv][cur] = ans[cur][prv] = 1;
				pa[fp(cur)] = fp(prv);
				prv = cur;
			}
		}
		else
		{
			for (int j=0 ; j<n ; j++) if (p[i][j] == 1 && fp(i) != fp(j)) return 0;
		}
	}

	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