CF1905B Begginer‘s Zelda 题解

题面翻译

给你一棵 $n$ 个点的树，操作是对于 $u,v$，将 $u$ 到 $v$ 的路径上的点全都缩成一个点。问最少几次操作使得整棵树变为一个点。

题目描述

You are given a tree $ ^{\dagger} $ . In one zelda-operation you can do follows:

• Choose two vertices of the tree $ u $ and $ v $ ;
• Compress all the vertices on the path from $ u $ to $ v $ into one vertex. In other words, all the vertices on path from $ u $ to $ v $ will be erased from the tree, a new vertex $ w $ will be created. Then every vertex $ s $ that had an edge to some vertex on the path from $ u $ to $ v $ will have an edge to the vertex $ w $ .

Illustration of a zelda-operation performed for vertices $ 1 $ and $ 5 $ .Determine the minimum number of zelda-operations required for the tree to have only one vertex.

$ ^{\dagger} $ A tree is a connected acyclic undirected graph.

输入格式

Each test consists of multiple test cases. The first line contains a single integer $ t $ ( $ 1 \le t \le 10^4 $ ) — the number of test cases. The description of the test cases follows.

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

$ i $ -th of the next $ n − 1 $ lines contains two integers $ u_i $ and $ v_i $ ( $ 1 \le u_i, v_i \le n, u_i \ne v_i $ ) — the numbers of vertices connected by the $ i $ -th edge.

It is guaranteed that the given edges form a tree.

It is guaranteed that the sum of $ n $ over all test cases does not exceed $ 10^5 $ .

输出格式

For each test case, output a single integer — the minimum number of zelda-operations required for the tree to have only one vertex.

样例 #1

样例输入 #1

4
4
1 2
1 3
3 4
9
3 1
3 5
3 2
5 6
6 7
7 8
7 9
6 4
7
1 2
1 3
2 4
4 5
3 6
2 7
6
1 2
1 3
1 4
4 5
2 6

样例输出 #1

1
3
2
2

提示

In the first test case, it’s enough to perform one zelda-operation for vertices $ 2 $ and $ 4 $ .

In the second test case, we can perform the following zelda-operations:

1. $ u = 2, v = 1 $ . Let the resulting added vertex be labeled as $ w = 10 $ ;
2. $ u = 4, v = 9 $ . Let the resulting added vertex be labeled as $ w = 11 $ ;
3. $ u = 8, v = 10 $ . After this operation, the tree consists of a single vertex.

题目思路

根据题目，每次操作可以将一条链缩为一个点。

观察发现，每条链最多可以覆盖 $2$ 个叶子结点，在这种情况下是最优的。

因此，若叶子结点的数量为 $x$，则答案为 $\frac{x+1}{2}$。

AC 代码

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
ll t,n,u,v,a[100010],ans;
int main()
{
	cin >> t;
	while(t--){
		memset(a, 0, sizeof(a));
		ans = 0;
		cin >> n;
		for(int i = 1;i <= n - 1;i++){
			cin >> u >> v;
			a[u]++,a[v]++;
		}
		for(int i = 1;i <= n;i++){
			if(a[i] == 1) ans++;
		}
		cout << (ans + 1) / 2 << endl;
	}
	return 0;
}

---

创作不易，白嫖不好，各位的支持和认可，就是我创作的最大动力，如果喜欢我的文章，给个关注吧！

冰焰狼 | 文

如果本篇博客有任何错误，请批评指教，不胜感激 ！