Submission #3239701

---

Source Code Expand

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

@author: maezawa
"""
from collections import deque

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])
cnt1 = 0
cnt2 = 0

turn = 0

while stack1 or stack2:
    turn += 1
    if stack1:
        f = stack1.pop()
        for m1 in adj[f]:
            if node[m1] != 0 and abs(node[m1]) < turn:
                continue
            else:
                node[m1] = turn
                stack1.append(m1)
                cnt1 += 1
    if stack2:
        s = stack2.pop()
        for m2 in adj[s]:
            if node[m2] != 0 and abs(node[m1]) <= turn:
                continue
            else:
                node[m2] = -turn
                stack2.append(m2)
                cnt2 += 1

if cnt1 > cnt2:
    print('Fennec')
else:
    print('Snuke')
            
            
        

Submission Info

Judge Result