hdu4714之树形DP

Tree2cycle

Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
Total Submission(s): 1251    Accepted Submission(s): 298

Problem Description

A tree with N nodes and N-1 edges is given. To connect or disconnect one edge, we need 1 unit of cost respectively. The nodes are labeled from 1 to N. Your job is to transform the tree to a cycle(without superfluous edges) using minimal cost.

A cycle of n nodes is defined as follows: (1)a graph with n nodes and n edges (2)the degree of every node is 2 (3) each node can reach every other node with these N edges.

 

Input

The first line contains the number of test cases T( T<=10 ). Following lines are the scenarios of each test case.
In the first line of each test case, there is a single integer N( 3<=N<=1000000 ) - the number of nodes in the tree. The following N-1 lines describe the N-1 edges of the tree. Each line has a pair of integer U, V ( 1<=U,V<=N ), describing a bidirectional edge (U, V).

 

Output

For each test case, please output one integer representing minimal cost to transform the tree to a cycle.

 

Sample Input

  
  

   
   1
4
1 2
2 3
2 4
  
  

 

Sample Output

  
  

   
   3

   
   

    
    

     
     Hint
    
    
In the sample above, you can disconnect (2,4) and then connect (1, 4) and
(3, 4), and the total cost is 3.

   
   
   
    
  
  
  
  

   
   

  
  

题意:题目意思为每删除一条边和增加一条边花费价值1，求用最小的价值去使得给定的树变成一个环

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#define INF 99999999
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000")

const int MAX=1000000+10;
int head[MAX],size,sum=0; 

struct Edge{
	int v,next;
	Edge(){}
	Edge(int V,int NEXT):v(V),next(NEXT){}
}edge[MAX*2];

void Init(int num){
	memset(head,-1,sizeof(int)*(num+1));
	size=sum=0;
}

void InsertEdge(int u,int v){
	edge[size]=Edge(v,head[u]);
	head[u]=size++;
}

int dfs(int u,int father){
	int num=0,v;
	for(int i=head[u];i != -1;i=edge[i].next){
		int v=edge[i].v;
		if(v == father)continue;
		num+=dfs(v,u);
	}
	if(num>=2){
		if(u == 1)sum+=num-2;
		else sum+=num-1;
		return 0;
	}else return 1;
}

int main(){
	int t,n,u,v;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		Init(n);
		for(int i=1;i<n;++i){
			scanf("%d%d",&u,&v);
			InsertEdge(u,v);
			InsertEdge(v,u);
		}
		dfs(1,0);
		printf("%d\n",sum*2+1);
	}
	return 0;
}