Submission #823100

#	Time	Username	Problem	Language	Result	Execution time	Memory
823100		Sohsoh84	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	150 ms	23940 KiB

supertrees

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

using namespace std;

const int MAXN = 1e5 + 10;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

int f[MAXN], sz[MAXN], L[MAXN], f2[MAXN];

vector<vector<int>> answer;

inline void add(int i, int j) {
	answer[i][j] = answer[j][i] = 1;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n, 0);
		answer.push_back(row);
	}

	vector<int> roots;
	for (int i = 0; i < n; i++) {
		f[i] = i;
		int lst = i;
		for (int j = 0; j < i; j++)
			if (p[i][j] == 1)
				lst = j;

		if (lst != i) add(lst, i), f[i] = f[lst];
		else roots.push_back(i);
	}

	int m = roots.size();
	for (int i = 0; i < m; i++) {
		f2[i] = i;
		int lst = i;
		for (int j = 0; j < i; j++)
			if (p[roots[i]][roots[j]] == 2)
				lst = j;

		if (lst != i) {
			add(roots[i], roots[lst]);
			f2[i] = f2[lst];
			L[f2[i]] = i;
		}
	}

	for (int i = 0; i < m; i++)
		if (L[i] != i)
			add(roots[i], roots[L[i]]);

	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