Submission #1688966

---

Source Code Expand

#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
//#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int,pii> piii;
vector<int>w;
int n;
vector<int>b;
vector<vector<int>>e;
void _bdfs(int v){
    rep(i,e[v].size()){
        int next=e[v][i];
        if(b[next]==INF&&next!=n-1){
            b[next]=b[v]+1;
            _bdfs(next);
        }
    }
}
void _wdfs(int v){
    rep(i,e[v].size()){
        int next=e[v][i];
        if(w[next]==INF&&next!=0){
            w[next]=w[v]+1;
            _wdfs(next);
        }
    }
}
signed main(){
    cin>>n;
    vector<vector<int>>edge(n,vector<int>());
    rep(i,n-1){
        pii t; cin>>t.first>>t.second;
        --t.first,--t.second;
        edge[t.first].push_back(t.second);
        edge[t.second].push_back(t.first);
    }
    e=edge;
    vector<int>_b(n,INF); _b[0]=0;
    vector<int>_w(n,INF);_w[n-1]=0;
    b=_b; w=_w;
    _bdfs(0);
    _wdfs(n-1);
    int wcnt=0;int bcnt=0;
    rep(i,n)if(b[i]<w[i])bcnt++; else wcnt++;
    if(bcnt>=wcnt)cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
}

Submission Info

Judge Result