Submission #3246715

---

Source Code Expand

#include<iostream>
#include<vector>
#include<stack>
using namespace std;

int main(){
    int n;
    cin >> n;

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

    int disto[n], distn[n];
    stack<pair<pair<int,int>, int>> s;
    
    s.push({{-1, 0}, 0});
    while(!s.empty()){
        pair<pair<int,int>,int> x = s.top();    s.pop();
        int parent = x.first.first;
        int now = x.first.second;
        int depth = x.second;
        disto[now] = depth;
        for(int next : v[now]){
            if(next != parent)  s.push({{now, next}, depth+1});
        }
    }
    
    s.push({{-1, n-1}, 0});
    while(!s.empty()){
        pair<pair<int,int>,int> x = s.top();    s.pop();
        int parent = x.first.first;
        int now = x.first.second;
        int depth = x.second;
        distn[now] = depth;
        for(int next : v[now]){
            if(next != parent)  s.push({{now, next}, depth+1});
        }
    }

    int fen = 0, snu = 0;
    for(int i = 0; i < n; i++){
        if(distn[i] >= disto[i])    fen++;
        else                        snu++;
    }

    if(fen <= snu)  cout << "Snuke" << endl;
    else                cout << "Fennec" << endl;

    return 0;
}

Submission Info

Judge Result