-
Notifications
You must be signed in to change notification settings - Fork 0
/
11725.py
45 lines (31 loc) · 918 Bytes
/
11725.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
import sys
sys.setrecursionlimit(10**9)
class Node:
def __init__(self, element):
self.element = element
self.children = []
self.parent = None
self.visited = False
def __str__(self):
return str(self.element)
def link(self, node):
self.children.append(node)
def traverse_and_mark(n, parent):
if n is not None and not n.visited:
n.visited = True
n.parent = parent
for child in n.children:
traverse_and_mark(child, n)
N = int(input())
nodes = []
for i in range(N+1):
nodes.append(Node(i))
for i in range(N-1):
a, b = [int(x) for x in sys.stdin.readline().strip().split()]
nodes[a].link(nodes[b])
nodes[b].link(nodes[a])
traverse_and_mark(nodes[1], None)
parents = []
for i in range(2,len(nodes)):
parents.append(str(nodes[i].parent))
print("\n".join(parents))