Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.01 s | 3 KBi |
#2 |
Correcto
|
0.01 s | 3 KBi |
#3 |
Correcto
|
0.01 s | 3 KBi |
#4 |
Correcto
|
0.009 s | 3 KBi |
#5 |
Correcto
|
0.009 s | 3 KBi |
#6 |
Correcto
|
0.009 s | 3 KBi |
#7 |
Correcto
|
0.01 s | 3 KBi |
#8 |
Correcto
|
0.01 s | 3 KBi |
#9 |
Incorrecto
|
0.009 s | 3 KBi |
#10 |
Correcto
|
0.025 s | 3 KBi |
#11 |
Correcto
|
0.01 s | 3 KBi |
#12 |
Incorrecto
|
0.297 s | 21 KBi |
#13 |
Incorrecto
|
0.324 s | 21 KBi |
#14 |
Incorrecto
|
0.304 s | 21 KBi |
#15 |
Incorrecto
|
0.281 s | 21 KBi |
#16 |
Tiempo límite excedido
|
1.597 s | 21 KBi |
#17 |
Tiempo límite excedido
|
1.596 s | 21 KBi |
#18 |
Tiempo límite excedido
|
1.597 s | 21 KBi |
#19 |
Tiempo límite excedido
|
1.56 s | 21 KBi |
#20 |
Tiempo límite excedido
|
1.562 s | 21 KBi |
N = int(input()) tree = {} for i in range(N - 1): treeData = input().split(' ') tree['0'] = None tree[treeData[1]] = treeData[0] # key=child, value=parent # print(tree) # exit() 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 parent = tree[child] while parent is not None: if parent == ancestor: print('Yes') wasYes = True break elif parent < ancestor: break parent = tree[parent] if not wasYes: print('No')