A ZJH and Monkeys 第十四届华中科技大学程序设计竞赛

链接： https://www.nowcoder.com/acm/contest/106/A
来源：牛客网

It’s universally acknowledged that there’re innumerable trees in the campus of HUST.  

One day, zjh is wandering in the campus,and he finds a tree with n monkeys on it, and he labels the monkeys from 1 to n. A triple of monkeys (a,b,c) is called happy if and only if the absolute value of the difference of the distance from c to a the distance from c to b holds the same parity(奇偶性) as n. Now zjh wants to know how many triples of monkeys are happy.

输入描述:

There are multiple test cases. 

The first line of input contains an integer T, indicating the number of test cases. 

For each test case:

The first line contains an integer n

In the next n-1 lines, each line contains two integers u_i and v_i, denoting an edge between monkey u_i and monkey v­_i.

思路：  第一种思路：  我们将 节点1 作为根节点，  然后求出其他点到根节点的奇偶性 并统计个数。

第二种思路： 我们两边dfs  求出树上的其他点到该点的距离为奇数，，偶数的个数。  

代码1： 

#include<stdio.h>
#include<string.h>
#include<vector>
#include<iostream>
#include<algorithm>
#define N 100005
 
using namespace std;
typedef long long ll;
int dis[N];
 
ll ans;
ll od,ev;
int n;
 
vector<int >ve[N];
 
void dfs(int u,int fa,int dep)
{
    dis[u]=dep;
    int sz=ve[u].size();
    for(int i=0;i<sz;i++){
        int v=ve[u][i];
        if(v==fa) continue;
        dfs(v,u,dep+1);
    }
    return ;
}
 
int main()
{
    int T;
    int u,v;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++) ve[i].clear();
        memset(dis,0,sizeof(dis));
        for(int i=1;i<n;i++){
            scanf("%d %d",&u,&v);
            ve[u].push_back(v);
            ve[v].push_back(u);
        }
         
        dfs(1,1,0);
        od=ev=0;
        
        
        for(int i=1;i<=n;i++){
            if(dis[i]%2==1){
            	od++;
          //  	printf("ji\n");
			}
            else{
            	ev++;
        //    	printf("ou\n");
			}
        }
        
        /*
        for(int i=1;i<=n;i++) printf("%d ",dis[i]);
        printf("\n");
        printf("lalla : %d %d\n",od,ev);
        */
        if(n%2==1){
             
            ans=0;
            ans=(ans+od*od*ev*2);
            ans=(ans+ev*od*ev*2);
            printf("%lld\n",ans);
        }
        else{
             
            ans=(od*od+ev*ev)*n;
            printf("%lld\n",ans);
             
        }
    }
    return 0;
}

/*

1
4
1 2
2 3
2 4


*/

代码2： 

#include<stdio.h>
#include<string.h>
#include<vector>
#include<iostream>
#include<algorithm>
#define N 100005

using namespace std;

struct node
{
	//int v;
	long long od;
	long long ev;
}tree[N];

vector< int >ve[N];
int n;

void dfs1(int u,int fa)
{
	int sz=ve[u].size();
	tree[u].ev=1;
	
	if(sz==1&&fa!=u){
	//	printf("dian : %d odd : %d  even :  %d\n",u,tree[u].od,tree[u].ev);
		return ;
	}
	
	for(int i=0;i<sz;i++)
	{
		int v=ve[u][i];
		if(v==fa) continue;
		dfs1(v,u);
		tree[u].ev+=tree[v].od;
		tree[u].od+=tree[v].ev;
	}
	
	//printf("dian : %d odd : %d  even :  %d\n",u,tree[u].od,tree[u].ev);
	return ;
}

void dfs2(int u,int fa)
{
	int sz=ve[u].size();
	for(int i=0;i<sz;i++){
		int v=ve[u][i];
		if(v==fa) continue;
		
		tree[v].ev+=(tree[u].od-tree[v].ev);
		tree[v].od+=(tree[u].ev-tree[v].od);
		dfs2(v,u);
	}
	return ;
}

int main()
{
	int T;
	int u,v;
	cin>>T;
	while(T--)
	{
		cin>>n;
		
		for(int i=1;i<=n;i++){
			ve[i].clear();
			tree[i].ev=tree[i].od=0;
		}
		
		for(int i=1;i<n;i++)
		{
			scanf("%d %d",&u,&v);
		    ve[u].push_back(v);
		    ve[v].push_back(u);
		}
		
		dfs1(1,1);
		/*for(int i=1;i<=n;i++){
			printf("%d %d\n",tree[i].ev,tree[i].od);
		}
		*/
		
		dfs2(1,1);
		/*
		for(int i=1;i<=n;i++){
			printf("%d %d\n",tree[i].ev,tree[i].od);
		}
		*/
		long long ans=0;
		if(n%2==1){
			for(int i=1;i<=n;i++){
				ans+=(tree[i].od*tree[i].ev);
			}
			cout<<ans*2<<endl;
		}
		else
		{
			for(int i=1;i<=n;i++)
			{
				ans+=(tree[i].ev*tree[i].ev+tree[i].od*tree[i].od);
			}
			cout<<ans<<endl;
		}
		
	}
	
	return 0;
}