Submission #3246698

---

Source Code Expand

# -*- coding: utf-8 -*-
"""
Created on Sat Sep 22 16:27:11 2018

@author: maezawa
"""
from collections import deque
import copy

n = int(input())
adj = [[] for _ in range(n+1)]
for i in range(n-1):
    ai, bi = list(map(int, input().split()))
    adj[ai].append(bi)
    adj[bi].append(ai)
    
#print(adj)

node = [0]*(n+1)
f = 1
s = n
node[f] = 1
node[s] = -1

stack1 = deque([f])
stack2 = deque([s])
nextstack1 = deque([])
nextstack2 = deque([])
cnt1 = 0
cnt2 = 0

turn = 1

while stack1 or stack2:
    turn += 1
    while stack1:
        f = stack1.pop()
        for m1 in adj[f]:
            if node[m1] != 0:
                continue
            else:
                node[m1] = turn
                nextstack1.append(m1)
    stack1 = copy.deepcopy(nextstack1)
    nextstack1 = deque([])

    while stack2:
        s = stack2.pop()
        for m2 in adj[s]:
            if node[m2] != 0:
                continue
            else:
                node[m2] = -turn
                nextstack2.append(m2)
    stack2 = copy.deepcopy(nextstack2)
    nextstack2 = deque([])

cnt = 0
for i in node:
    if i>0:
        cnt += 1
    elif i<0:
        cnt -= 1
if cnt > 0:
    print('Fennec')
else:
    print('Snuke')
            
            
        

Submission Info

Judge Result