Codeforces Round #798 C. Infected Tree

Demoo.

已于 2022-06-12 14:05:38 修改

阅读量487

点赞数 1

分类专栏： dp 文章标签： c语言 p2p 开发语言

于 2022-06-12 13:35:38 首次发布

本文链接：https://blog.csdn.net/qq_61903556/article/details/125244625

版权

dp 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

本文介绍了如何解决一个关于二叉树的感染问题。给定一棵以1为根的二叉树，病毒感染从根开始传播。在每一步中，米莎可以选择一个未感染的节点删除，防止病毒扩散。目标是找出最多能保存的未感染节点。题目提供了一个示例和对应的解决方案，通过深度优先搜索策略计算每个节点的最大存活数。代码示例展示了如何实现这个算法。

摘要由CSDN通过智能技术生成

Byteland is a beautiful land known because of its beautiful trees.

Misha has found a binary tree with nn vertices, numbered from 11 to nn. A binary tree is an acyclic connected bidirectional graph containing nn vertices and n−1n−1 edges. Each vertex has a degree at most 33, whereas the root is the vertex with the number 11 and it has a degree at most 22.

Unfortunately, the root got infected.

The following process happens nn times:

Misha either chooses a non-infected (and not deleted) vertex and deletes it with all edges which have an end in this vertex or just does nothing.
Then, the infection spreads to each vertex that is connected by an edge to an already infected vertex (all already infected vertices remain infected).

As Misha does not have much time to think, please tell him what is the maximum number of vertices he can save from the infection (note that deleted vertices are not counted as saved).

Input

There are several test cases in the input data. The first line contains a single integer tt (1≤t≤50001≤t≤5000) — the number of test cases. This is followed by the test cases description.

The first line of each test case contains one integer nn (2≤n≤3⋅1052≤n≤3⋅105) — the number of vertices of the tree.

The ii-th of the following n−1n−1 lines in the test case contains two positive integers uiui and vivi (1≤ui,vi≤n1≤ui,vi≤n), meaning that there exists an edge between them in the graph.

It is guaranteed that the graph is a binary tree rooted at 11. It is also guaranteed that the sum of nn over all test cases won't exceed 3⋅1053⋅105.

Output

For each test case, output the maximum number of vertices Misha can save.

Example

input

Copy

output

Copy

Note

In the first test case, the only possible action is to delete vertex 22, after which we save 00 vertices in total.

In the second test case, if we delete vertex 22, we can save vertices 33 and 44.

这一题的思路一个佬的博客讲的非常清晰我超越不了直接贴上顺便膜个佬

Infected Tree - cbmango - 博客园

贴贴我自己写的代码吧~（虽然跟佬写的差不多

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>

using namespace std;
const int N=300005;
int n;
int f[N];
int cnt[N];
vector<int> v[2*N];
void dfs1(int u,int father){
	cnt[u]=1;
	for(int i=0;i<v[u].size();i++){
		int op=v[u][i];
		if(op==father)continue;
		dfs1(op,u);
		cnt[u]+=cnt[op];
	}
}
void dfs2(int u,int father){
	if(v[u].size()==1&&u!=1)f[u]=0;
	else if(v[u].size()==2&&u!=1){
		for(int i=0;i<v[u].size();i++){
			int op=v[u][i];
			if(op==father)continue;
			f[u]=cnt[op]-1;
		}
	}else{
		int a=-1,b=-1;
		for(int i=0;i<v[u].size();i++){
			int op=v[u][i];
			if(op==father)continue;
			if(a==-1){
				a=op;
			}else if(b==-1){
				b=op;
			}
			dfs2(op,u);//我们找到左右子树的时候我们需要递归更新他们的f
		}
		f[u]=max(f[a]+cnt[b]-1,f[b]+cnt[a]-1);
	}
	
}
void sove(){
	cin>>n;
	for(int i=1;i<=n;i++){
		v[i].clear();
		f[i]=0;
		cnt[i]=0;
	}
	for(int i=1;i<n;i++){
		int a,b;
		cin>>a>>b;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	dfs1(1,-1);
	dfs2(1,-1);
	printf("%d\n",f[1]);
}
int main(){
	int t;
	cin>>t;
	while(t--){
		sove();
	}
	return 0;
}