1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1e:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T42a,#include using namespace std; int main() { int n, r; cin >> n >> r; vector> adj(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } int LOG = 1; while ((1 << LOG) < n) LOG++; LOG++; vector> up(LOG, vector(n + 1, 0)); vector depth(n + 1, -1); depth[r] = 0; queue q0; q0.push(r); while (!q0.empty()) { int u = q0.front(); q0.pop(); for (int v : adj[u]) if (depth[v] == -1) { depth[v] = depth[u] + 1; up[0][v] = u; q0.push(v); } } for (int k = 1; k < LOG; k++) for (int v = 1; v <= n; v++) up[k][v] = up[k - 1][up[k - 1][v]]; int q; cin >> q; string out; while (q--) { int x, k; cin >> x >> k; if (k > depth[x]) { out += "-1\n"; continue; } int cur = x; for (int j = 0; j < LOG; j++) if ((k >> j) & 1) cur = up[j][cur]; out += to_string(cur); out += "\n"; } cout << out; return 0; } 1c:T42a,#include using namespace std; int main() { int n, r; cin >> n >> r; vector> adj(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } int LOG = 1; while ((1 << LOG) < n) LOG++; LOG++; vector> up(LOG, vector(n + 1, 0)); vector depth(n + 1, -1); depth[r] = 0; queue q0; q0.push(r); while (!q0.empty()) { int u = q0.front(); q0.pop(); for (int v : adj[u]) if (depth[v] == -1) { depth[v] = depth[u] + 1; up[0][v] = u; q0.push(v); } } for (int k = 1; k < LOG; k++) for (int v = 1; v <= n; v++) up[k][v] = up[k - 1][up[k - 1][v]]; int q; cin >> q; string out; while (q--) { int x, k; cin >> x >> k; if (k > depth[x]) { out += "-1\n"; continue; } int cur = x; for (int j = 0; j < LOG; j++) if ((k >> j) & 1) cur = up[j][cur]; out += to_string(cur); out += "\n"; } cout << out; return 0; } 1d:T4f9,import sys from collections import deque def main(): data = sys.stdin.read().split() idx = 0 n = int(data[idx]); idx += 1 r = int(data[idx]); idx += 1 adj = [[] for _ in range(n + 1)] for _ in range(n - 1): x = int(data[idx]); idx += 1 y = int(data[idx]); idx += 1 adj[x].append(y); adj[y].append(x) LOG = 1 while (1 << LOG) < n: LOG += 1 LOG += 1 up = [[0] * (n + 1) for _ in range(LOG)] depth = [-1] * (n + 1) depth[r] = 0 q0 = deque([r]) while q0: u = q0.popleft() for v in adj[u]: if depth[v] == -1: depth[v] = depth[u] + 1 up[0][v] = u q0.append(v) for k in range(1, LOG): upk, upk1 = up[k], up[k - 1] for v in range(1, n + 1): upk[v] = upk1[upk1[v]] q = int(data[idx]); idx += 1 out = [] for _ in range(q): x = int(data[idx]); idx += 1 k = int(data[idx]); idx += 1 if k > depth[x]: out.append("-1") continue cur = x j = 0 while k: if k & 1: cur = up[j][cur] k >>= 1 j += 1 out.append(str(cur)) print("\n".join(out)) main()