Submission #1688953

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int n;
  cin>>n;
  vector<vi> g(n);
  rep(i,n-1){
    int a,b;
    cin>>a>>b;
    a--,b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  vi df(n,-1),ds(n,-1);
  queue<int> q;
  q.push(0);
  df[0]=0;
  while(q.size()){
    int p=q.front();
    q.pop();
    rep(i,g[p].size()){
      int next=g[p][i];
      if(df[next]==-1){
	df[next]=df[p]+1;
	q.push(next);
      }
    }
  }
  q.push(n-1);
  ds[n-1]=0;
  while(q.size()){
    int p=q.front();
    q.pop();
    rep(i,g[p].size()){
      int next=g[p][i];
      if(ds[next]==-1){
        ds[next]=ds[p]+1;
        q.push(next);
      } 
    }
  }
  int f=0,s=0;
  rep(i,n)
    if(ds[i]<df[i])s++;
    else f++;
  if(s<=f)cout<<"Fennec"<<endl;
  else cout<<"Snuke"<<endl;
}

Submission Info

Judge Result