Submission #1516962

---

Source Code Expand

#include<iostream>
#include<vector>
#include<math.h>
#include<map>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<functional>
using namespace std;
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,a) for(int i=0;i<(a);++i)
typedef pair<int, int> P;
typedef pair<pair<P, P>, P>PP;
typedef long long LL;
#define INF LL(1e18)
#define N 100000
int n, judge;
int flag1[N], flag2[N];
vector<int> edge[N];

int bfs(int s, int flag[])
{
	queue<int> que;
	que.push(s);
	while(!(que.empty()))
	{
		int now = que.front();
		que.pop();
		REP(i, edge[now].size())
		{
			int to = edge[now][i];
			if(!flag[to] && to != s)
			{
				flag[to] = flag[now] + 1;
				que.push(to);
			}
		}
	}
}
int main()
{
	cin >> n;
	REP(i, n - 1)
	{
		int a, b;
		cin >> a >> b;
		--a; --b;
		edge[b].push_back(a);
		edge[a].push_back(b);
	}
	bfs(0, flag1);
	bfs(n - 1, flag2);
	REP(i, n)
	{
		if(flag1[i] <= flag2[i])
		{
			judge++;
		}
	}

	if(judge > n / 2)
	{
		cout << "Fennec" << endl;
	}
	else
	{	
		cout << "Snuke" << endl;
	}
	return 0;
}

Submission Info

Judge Result