hdu3094 A tree game

A tree game

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 424 Accepted Submission(s): 207

Problem Description

Alice and Bob want to play an interesting game on a tree.
Given is a tree on N vertices, The vertices are numbered from 1 to N. vertex 1 represents the root. There are N-1 edges. Players alternate in making moves, Alice moves first. A move consists of two steps. In the first step the player selects an edge and removes it from the tree. In the second step he/she removes all the edges that are no longer connected to the root. The player who has no edge to remove loses.
You may assume that both Alice and Bob play optimally.

Input

The first line of the input file contains an integer T (T<=100) specifying the number of test cases.
Each test case begins with a line containing an integer N (1<=N<=10^5), the number of vertices,The following N-1 lines each contain two integers I , J, which means I is connected with J. You can assume that there are no loops in the tree.

Output

For each case, output a single line containing the name of the player who will win the game.

Sample Input

  
  

   
   3
3
1 2
2 3

3
1 2
1 3 

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

Sample Output

  
  

   
   Alice
Bob
Alice
  
  
  
  

   
   组合游戏略述 ——浅谈SG游戏的若干拓展及变形　论文上说的很详细了！
  
  
  
  

   
   
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define M 100500
vector<int > vec[M];
int vis[M],dp[M];
int dfs(int x){
    if(dp[x]!=-1)return dp[x];
    vis[x]=1;
    dp[x]=0;
    for(int i=0;i<vec[x].size();i++){
        if(!vis[vec[x][i]])
        dp[x]^=dfs(vec[x][i])+1;
    }
    return dp[x];
}
int main()
{
    int tcase,n,i,s,e;
    scanf("%d",&tcase);
    while(tcase--){
        scanf("%d",&n);
        for(i=0;i<=n;i++)vec[i].clear();
        memset(vis,0,sizeof(vis));
        memset(dp,-1,sizeof(dp));
        n--;
        while(n--){
            scanf("%d%d",&s,&e);
            vec[s].push_back(e);
            vec[e].push_back(s);
        }
        if(dfs(1))printf("Alice\n");
        else printf("Bob\n");
    }
    return 0;
}