100pts求调

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
int n, f[N][30], m, a[N], dep[N];
vector<int> g[N];
void dfs(int u, int fa)
{
    f[u][0] = fa;
    dep[u] = dep[fa] + 1;
    for (int i = 1; i <= 25; i++)
    {
        f[u][i] = f[f[u][i - 1]][i - 1];
    }
    for (auto v: g[u])
    {
        if (v != fa) dfs(v, u);
    }
}
int lca(int u, int v)
{
    if (dep[u] < dep[v]) swap(u, v);
    for (int i = 25; i >= 0; i--)
    {
        if (dep[f[u][i]] >= dep[v]) u = f[u][i];
    }
    if (u == v) return u;
    for (int i = 25; i >= 0; i--)
    {
        if (f[u][i] != f[v][i])
        {
            u = f[u][i];
            v = f[v][i];
        }
    }
    return f[u][0];
}
void solve()
{
    cin >> m >> a[1];
    int ans = a[1];
    for (int i = 2; i <= m; i++)
    {
        cin >> a[i];
        ans = lca(ans, a[i]);
    }
    cout << ans << '\n';
    return ;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n;
    for (int i = 1; i < n; i++)
    {
        int x;
        cin >> x;
        g[x].push_back(i);
    }
    dfs(0, 0);
    int Q;
    cin >> Q;
    while (Q--)
    {
        solve();
    }
    return 0;
}