Submission #1872577

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;

vector<int> vp[100001];
int dd1[100001],dd2[100001];
int d1=0,d2=0;
bool used[100001];
int main(){
    int n,sr,ds;
    cin>>n;
    rep(i,n-1){
        cin>>sr>>ds;
        vp[sr-1].pb(ds-1);
        vp[ds-1].pb(sr-1);
    }
    queue<pint> q;
    q.push(mp(0,0));
    used[0]=true;
    while(!q.empty()){
        pint pi=q.front();q.pop();
        int cur=pi.first;
        dd1[cur]=pi.second;
        rep(i,vp[cur].size()){
            if(!used[vp[cur][i]]){
                q.push(mp(vp[cur][i],pi.second+1));
                used[vp[cur][i]]=true;
            }
        }
    }
    memset(used,0,sizeof(used));
    q.push(mp(n-1,0));
    used[n-1]=true;
    while(!q.empty()){
        pint pi=q.front();q.pop();
        int cur=pi.first;
        dd2[cur]=pi.second;
        rep(i,vp[cur].size()){
            if(!used[vp[cur][i]]){
                q.push(mp(vp[cur][i],pi.second+1));
                used[vp[cur][i]]=true;
            }
        }
    }
    int cnt1=0,cnt2=0;
    rep(i,n){
        if(dd1[i]<=dd2[i]) ++cnt1;
        else ++cnt2;
    }
    if(cnt1>cnt2) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
    return 0;
}

Submission Info

Judge Result