【2022牛客多校3】A-Ancestor (LCA)

题目

https://ac.nowcoder.com/acm/contest/33188/A

样例

链接：https://ac.nowcoder.com/acm/contest/33188/A
来源：牛客网

输入
10 3
10 9 8
8 9 9 2 7 9 0 0 7 4
1 1 2 4 3 4 2 4 7
7 7 2 3 4 5 6 1 5 3
1 1 3 1 2 4 7 3 5
输出
2

思路

分别求个前缀、后缀LCA，再枚举删掉的点，计算剩下的 k-1 个点的LCA，比较一下就行了。
时间复杂度是 k*logn

代码

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

#define MAXN 100005

int n, k;
int xx[MAXN];
int a[MAXN];
int b[MAXN];
int fa[MAXN][20];
int fb[MAXN][20];
int da[MAXN];
int db[MAXN];
vector<int> ga[MAXN], gb[MAXN];
int pal[MAXN], par[MAXN];
int pbl[MAXN], pbr[MAXN];

void get_st(int ff[MAXN][20])
{
    for (int j=1; j<20; j++)
        for (int i=1; i<=n; i++)
            ff[i][j] = ff[ff[i][j-1]][j-1];
}

void dfs(int x, int dep, vector<int> *g, int *d)
{
    d[x] = dep;
    for (int o: g[x])
        dfs(o, dep+1, g, d);
}

int FA(int ST[MAXN][20], int x, int y)    // x 往上走 y 步
{
    for (int i=0; y; i++, y>>=1)
        if (y&1) x = ST[x][i];
    return x;
}

int LCA(int ST[MAXN][20], int *d, int x, int y)
{
    if (d[x]<d[y]) swap(x, y);
    x = FA(ST, x, d[x]-d[y]);
    if (x==y) return x;
    for (int i=19; i>=0; i--)
        if (ST[x][i] != ST[y][i])
            x = ST[x][i], y = ST[y][i];
    return ST[x][0];
}

void solve()
{
    scanf("%d%d", &n, &k);
    for (int i=1; i<=k; i++) scanf("%d", &xx[i]);
    for (int i=1; i<=n; i++) scanf("%d", &a[i]);
    for (int i=2; i<=n; i++) {scanf("%d", &fa[i][0]); ga[fa[i][0]].push_back(i);}
    for (int i=1; i<=n; i++) scanf("%d", &b[i]);
    for (int i=2; i<=n; i++) {scanf("%d", &fb[i][0]); gb[fb[i][0]].push_back(i);}

    dfs(1, 0, ga, da);
    dfs(1, 0, gb, db);

    get_st(fa);
    get_st(fb);

    pal[1] = pbl[1] = xx[1];
    for (int i=2; i<=k; i++) {
        pal[i] = LCA(fa, da, pal[i-1], xx[i]);
        pbl[i] = LCA(fb, db, pbl[i-1], xx[i]);
    }
    par[k] = pbr[k] = xx[k];
    for (int i=k-1; i>=1; i--) {
        par[i] = LCA(fa, da, par[i+1], xx[i]);
        pbr[i] = LCA(fb, db, pbr[i+1], xx[i]);
    }

    int ans=0;
    if (a[par[2]] > b[pbr[2]]) ans++;
    if (a[pal[k-1]] > b[pbl[k-1]]) ans++;

    for (int i=2, ta, tb; i<k; i++) {
        ta = LCA(fa, da, pal[i-1], par[i+1]);
        tb = LCA(fb, db, pbl[i-1], pbr[i+1]);
        if (a[ta] > b[tb]) ans++;
    }

    printf("%d\n", ans);
}


int main()
{
    solve();
}