F. Programming Competition

最新推荐文章于 2024-09-06 16:14:20 发布

KQYaili

最新推荐文章于 2024-09-06 16:14:20 发布

阅读量865

点赞数 23

文章标签：图论算法

本文链接：https://blog.csdn.net/KQYaili/article/details/135152217

版权

BerSoft is the biggest IT corporation in Berland. There are $n$ employees at BerSoft company, numbered from $1$ to $n$ .

The first employee is the head of the company, and he does not have any superiors. Every other employee $i$ has exactly one direct superior $p_i$ .

Employee $x$ is considered to be a superior (direct or indirect) of employee $y$ if one of the following conditions holds:

employee $x$ is the direct superior of employee $y$ ;
employee $x$ is a superior of the direct superior of employee $y$ .

The structure of BerSoft is organized in such a way that the head of the company is superior of every employee.

A programming competition is going to be held soon. Two-person teams should be created for this purpose. However, if one employee in a team is the superior of another, they are uncomfortable together. So, teams of two people should be created so that no one is the superior of the other. Note that no employee can participate in more than one team.

Your task is to calculate the maximum possible number of teams according to the aforementioned rules.
Input

The first line contains a single integer $t$ ( $\le t \le 10^4$ ) — the number of test cases.

The first line of each test case contains a single integer $n$ ( $\le n \le 2 \cdot 10^5$ ) — the number of employees.

The second line contains $n - 1$ integers $p_2, p_3, \dots, p_n$ ( $\le p_i \le n$ ), where $p_i$ is the index of the direct superior of the $i$ -th employee.

The sum of $n$ over all test cases doesn’t exceed $\cdot 10^5$ .
Output

For each test case, print a single integer — the maximum possible number of teams according to the aforementioned rules.
贪心+树形dp

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, M = 4e5 + 10;
int h[N], e[M], ne[M], idx;
int sz[N];
void add(int a, int b)
{
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
void init(int u)
{
	sz[u] = 1;
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
        init(v);
		sz[u] += sz[v];
	}
}
int dfs(int u, int k)
{
	int tot = 0, mx = -1;
	for (int i = h[u]; ~i; i = ne[i])
	{
		int v = e[i];
		tot += sz[v];
		if (mx == -1 || sz[mx] < sz[v])mx = v;
	}
	if (tot == 0)return 0;
	if (sz[mx] - k <= tot - sz[mx])
		return (tot - k) / 2;
	int add = tot - sz[mx];
	return add + dfs(mx, max(0, add + k - 1));
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		memset(h, -1, sizeof h);
		idx = 0;
		for (int i = 2; i <= n; i++)
		{
			int p;
			cin >> p;
			add(p, i);
		}
		init(1);
		cout << dfs(1, 0) << endl;
	}
}