Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 68 KBi |
#3 |
Correcto
|
0.004 s | 22 KBi |
#4 |
Correcto
|
0.004 s | 8 KBi |
#5 |
Correcto
|
0.001 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.005 s | 14 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.003 s | 0 KBi |
#11 |
Correcto
|
0.004 s | 19 KBi |
#12 |
Correcto
|
0.163 s | 1 KBi |
#13 |
Correcto
|
0.13 s | 1 KBi |
#14 |
Correcto
|
0.16 s | 4 KBi |
#15 |
Correcto
|
0.052 s | 1 KBi |
#16 |
Tiempo límite excedido
|
1.028 s | 2 KBi |
#17 |
Tiempo límite excedido
|
1.062 s | 1 KBi |
#18 |
Tiempo límite excedido
|
1.1 s | 1 KBi |
#19 |
Tiempo límite excedido
|
1.1 s | 1 KBi |
#20 |
Tiempo límite excedido
|
1.051 s | 69 KBi |
#include <bits/stdc++.h> #define REP(i, n) for (int i = 0; i < n; i++) #define pb push_back #define ff first #define ss second #define ii pair<int, int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); using namespace std; ostream &operator<<(ostream &os, const vector<int> &v) { for (auto const &i : v) { os << i << " "; } os << endl; return os; } const lli mod = (1e9) + 7; const int N = 1e4 + 1; int main() { fast_io; int n; cin >> n; vector<int> g(n, -1); // just save father of node int p, h; REP(i, n - 1) { cin >> p >> h; g[h] = p; } int c; cin >> c; int a, b; while (c--) { cin >> a >> b; // check if a is ancestor of b bool encountered = false; if( a == b )encountered = true; while (g[b] != -1 && !encountered) { if (g[b] == a) encountered = true; b = g[b]; } cout<<(encountered ? "Yes" : "No")<<endl; } return 0; }