P3258 [JLOI2014] 松鼠的新家

合集 - 区间问题(37)

1.Iva & Pav2024-02-172.P2023 [AHOI2009] 维护序列2024-02-203.P1531 I Hate It2024-02-204.P5057 [CQOI2006] 简单题2024-02-205.P2357 守墓人2024-02-206.P8775 [蓝桥杯 2022 省 A] 青蛙过河2024-02-217.Dora and Search2024-02-248.P6492 [COCI2010-2011#6] STEP2024-02-269.D. Slimes2024-02-2810.P1040 [NOIP2003 提高组] 加分二叉树2024-03-0311.P2466 [SDOI2008] Sue 的小球2024-03-0412.P3957 [NOIP2017 普及组] 跳房子2024-03-0613.P2135 方块消除2024-03-0614.P1884 [USACO12FEB] Overplanting S2024-03-1015.P2642 双子序列最大和2024-03-2516.P2422 良好的感觉2024-03-2517.P3128 [USACO15DEC] Max Flow P2024-04-02

18.P3258 [JLOI2014] 松鼠的新家2024-04-02

19.P3384 【模板】重链剖分/树链剖分2024-04-0320.P5367 【模板】康托展开2024-04-0521.P2344 [USACO11FEB] Generic Cow Protests G2024-04-1322.P2709 小B的询问2024-04-1623.P4145 上帝造题的七分钟 2 / 花神游历各国2024-04-1724.P5677 [GZOI2017] 配对统计2024-04-1725.P2161 [SHOI2009] 会场预约2024-04-1726.F. Equal XOR Segments2024-05-0427.D. A BIT of an Inequality2024-05-0428.P3147 [USACO16OPEN] 262144 P2024-05-1329.P4290 [HAOI2008] 玩具取名2024-05-1330.E. Long Inversions2024-04-0931.P1668 [USACO04DEC] Cleaning Shifts S2024-05-1732.P9691 [GDCPC2023] Base Station Construction2024-05-1833.P2734 [USACO3.3] 游戏 A Game2024-06-0834.D. Sum of XOR Functions2024-06-1435.C. Medium Design2024-06-2836.F. Feed Cats2024-07-0737.E. Boring Segments2024-07-28

收起

原题链接

题解

1.小模拟+树上差分+lca

code

#include<bits/stdc++.h>
using namespace std;
int a[300006]={0};
vector<int> G[300005];
int depth[500005]={0};
int fa[500005][30]={0};
int tree[500005]={0};
void dfs(int now,int pre)
{
    fa[now][0]=pre;
    depth[now]=depth[pre]+1;
    for(auto next:G[now])
    {
        if(next==pre) continue;
        dfs(next,now);
    }
}
int n;
void init()
{
    for(int k=1;k<=22;k++)
    {
        for(int i=1;i<=n;i++)
        {
            fa[i][k]=fa[fa[i][k-1]][k-1];
        }
    }
}

int lca(int x,int y)
{
    if(depth[x]<depth[y]) swap(x,y);
    for(int i=22;i>=0;i--) if(depth[fa[x][i]]>=depth[y]) x=fa[x][i];
    if(x==y) return x;
    for(int i=22;i>=0;i--)
    {
        if(fa[x][i]!=fa[y][i])
        {
            x=fa[x][i];
            y=fa[y][i];
        }
    }
    return fa[x][0];
}



void cal(int now,int pre)
{
    for(auto next:G[now])
    {
        if(next==pre) continue;
        cal(next,now);
        tree[now]+=tree[next];
    }
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    dfs(1,0);
    init();

    for(int i=2;i<=n;i++)
    {
        int x=a[i-1],y=a[i];

        tree[x]++;
        tree[fa[y][0]]++;
        int f=lca(x,y);
        tree[f]--;
        tree[fa[f][0]]--;
    }

    cal(1,0);
    for(int i=1;i<=n;i++) cout<<tree[i]<<endl;
    return 0;
}