Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.011 s | 3 KBi |
#2 |
Correcto
|
0.016 s | 3 KBi |
#3 |
Correcto
|
0.012 s | 3 KBi |
#4 |
Correcto
|
0.01 s | 3 KBi |
#5 |
Correcto
|
0.011 s | 3 KBi |
#6 |
Correcto
|
0.01 s | 3 KBi |
#7 |
Correcto
|
0.012 s | 3 KBi |
#8 |
Correcto
|
0.027 s | 7 KBi |
#9 |
Correcto
|
0.01 s | 3 KBi |
#10 |
Correcto
|
0.034 s | 7 KBi |
#11 |
Correcto
|
0.011 s | 3 KBi |
#12 |
Correcto
|
0.404 s | 21 KBi |
#13 |
Correcto
|
0.955 s | 21 KBi |
#14 |
Correcto
|
0.962 s | 21 KBi |
#15 |
Correcto
|
0.92 s | 23 KBi |
#16 |
Tiempo límite excedido
|
1.601 s | 21 KBi |
#17 |
Tiempo límite excedido
|
1.56 s | 21 KBi |
#18 |
Tiempo límite excedido
|
1.601 s | 21 KBi |
#19 |
Tiempo límite excedido
|
1.564 s | 21 KBi |
#20 |
Tiempo límite excedido
|
1.572 s | 21 KBi |
N = int(input()) tree = {} for i in range(N - 1): treeData = input().split(' ') tree[treeData[1]] = treeData[0] C = int(input()) for i in range(C): wasYes = False query = input().split(' ') ancestor = query[0] child = query[1] if ancestor == '0' or ancestor == child: print('Yes') continue try: parent = tree[child] except: parent = None while parent is not None: if parent == ancestor: print('Yes') wasYes = True break try: parent = tree[parent] except: parent = None if not wasYes: print('No')