Submission #1430772

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define BLACK 0
#define WHITE 1

vector < int > d[100001];

void bfs(int n){
  
  int count[2]={};

  map< int , bool > visited;
  queue< pair<int,int> > q;

  q.push( make_pair( 1, BLACK ));
  visited[1]=true;
  
  q.push( make_pair( n, WHITE ));
  visited[n]=true;
  
  while(!q.empty()){
    P np = q.front();
    int pos=np.first;
    int color=np.second;
    q.pop();

    for(int i=0;i<(int)d[pos].size();i++){
      int to=d[pos][i];
      if(visited[to])continue;
      visited[to]=true;
      count[ color ]++;
      q.push( make_pair( to, color ) );
    }
    
  }
  if(count[BLACK]>count[WHITE])cout<<"Fennec"<<endl;
  else cout<<"Snuke"<<endl;

}



int main(){
  int n,a,b;
  cin>>n;
  
  for(int i=0;i<n-1;i++){
    cin>>a>>b;
    d[a].push_back(b);
    d[b].push_back(a);
  }
  bfs(n);
  
  
  return 0;
}

Submission Info

Judge Result