AtCoder Regular Contest 078 D

D - Fennec VS. Snuke

Time limit : 2sec / Memory limit : 256MB

Score : 400 points

Problem Statement

Fennec and Snuke are playing a board game.

On the board, there are N cells numbered 1 through N, and N−1 roads, each connecting two cells. Cell ai is adjacent to Cell bi through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.

Initially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored. Fennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell. More specifically, each player performs the following action in her/his turn:

Fennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.
Snuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.

A player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.

Constraints

2≤N≤10⁵
1≤ai,bi≤N
The given graph is a tree.

Input

Input is given from Standard Input in the following format:

N

a1 b1

:

aN−1 bN−1

Output

If Fennec wins, print Fennec; if Snuke wins, print Snuke.

Sample Input 1

Copy

Sample Output 1

Copy

Fennec

For example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.

Sample Input 2

Copy

Sample Output 2

Copy

Snuke
题意：有一颗树，第一个点颜色为1，最后一点颜色为2,1颜色可以将它相邻的点染色成1颜色，2颜色同理，现在F先手，S后手，最后不能染色算输，最后谁赢了
解法：
1 F开始染色第1点和它周围点（ABC....），然后S开始染色第N点和它周围点(abc..)，然后F染色A点和A点相邻点，然后S染色a点和a点相邻点...
2 明白了吗？最后谁染色的点多谁就赢了
3 这里染色讲究先后，我们用队列广搜

 #include <iostream>

 #include <stdio.h>

 #include <vector>

 #include <queue>

 #define N 100005

 using namespace std;

 vector <int> vec[N];

 int color[N];

 int main(){

     queue <int> que;

     int n , x , y;

     scanf("%d",&n);

     for(int i =  ; i < n ; i ++){

         scanf("%d%d",&x,&y);

         vec[x].push_back(y);

         vec[y].push_back(x);

     }

     color[] =  , color[n] = ;

     int cnt[] = { , };

     que.push() ;

     que.push(n);

     while(!que.empty()){

         int x = que.front();

         que.pop();

         cnt[color[x]] ++;

         for(int i =  ; i < vec[x].size() ; i ++){

             int v = vec[x][i];

             if(color[v]) continue;

             color[v] = color[x];

             que.push(v);

         }

     }

     if(cnt[] >= cnt[]){

         printf("Snuke\n");

     }else{

         printf("Fennec\n");

     }

 }