hdu 3094 A tree game 2009 Multi-University Training Contest 18 - Host by ECNU

首先用DFS将无根树转化成有根树，之后再用上一篇树上删边博弈的结论。我是不是来凑篇数的><

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<stdlib.h>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<ctype.h>
#include<map>
#include<time.h>
#include<bitset>
#include<set>
#include<list>
using namespace std;
//hdu 3094

const int maxn=100010;
int T;
int N;
vector<int>tree[maxn];
int ans;
int father[maxn];
int rt;
void dfsfather(int u, int fa)
{   //递归转化为以u为根的子树，u的父亲为fa
    int d=tree[u].size();        //节点u的相邻点的个数
    for(int i=0;i<d;i++)
    {    //循环遍历跟这个节点相连接的d个节点。
        int v=tree[u][i];       //节点u的第i个相邻点v
        if(fa!=v)
        {
            father[v]=u;
          //  cout<<u<<" "<<v<<endl;
            dfsfather(v,u);  //把v的父亲节点设为u，然后递归转化为以v为根的子树
        //一定要判断v是否和其父亲节点相等！
        }
    }
}
int dfs_solve(int rt)
{
    int ret=0;
    for(int i=0;i<tree[rt].size();i++)
    {
        if(tree[rt][i]==father[rt])
        {
            continue;
        }
       // cout<<rt<<" "<<tree[rt][i]<<endl;
        ret^=(dfs_solve(tree[rt][i])+1);
    }
    return ret;
}
int main()
{
    freopen("input.txt","r",stdin);
    scanf("%d",&T);
    for(int ca=1;ca<=T;ca++)
    {
        scanf("%d",&N);
        memset(tree,0,sizeof(tree));
        memset(father,0,sizeof(father));
        ans=0;
        rt=1;
        for(int i=1;i<N;i++)
        {
            int x=0;
            int y=0;
            scanf("%d %d",&x,&y);
            tree[x].push_back(y);
            tree[y].push_back(x);
        }
        dfsfather(rt,-1);
        ans=dfs_solve(1);
        if(ans==0)
        {
            printf("Bob\n");
        }
        else
        {
            printf("Alice\n");
        }
    }
    return 0;
}