F. Gardening Friends

合集 - 树论(34)

1.P3478 [POI2008] STA-Station2024-03-192.E1. Weights Division (easy version)2024-03-223.P5007 DDOSvoid 的疑惑2024-03-254.P2168 [NOI2015] 荷马史诗2024-03-305.P8306 【模板】字典树2024-03-306.P1481 魔族密码2024-03-307.P3128 [USACO15DEC] Max Flow P2024-04-028.P3258 [JLOI2014] 松鼠的新家2024-04-029.P5536 【XR-3】核心城市2024-04-0210.P5836 [USACO19DEC] Milk Visits S2024-04-0211.P3384 【模板】重链剖分/树链剖分2024-04-0312.P3038 [USACO11DEC] Grass Planting G2024-04-0313.P4551 最长异或路径2024-04-0414.F. Alex's whims2024-04-1215.J. 上学2024-05-1416.Game on Tree2024-05-1417.E. We Need More Bosses2024-05-1518.A. Party2024-05-1519.D. Strong Vertices2024-05-1620.B. Omkar and Heavenly Tree2024-05-1621.B. Mahmoud and Ehab and the bipartiteness2024-05-1622.P8655 [蓝桥杯 2017 国 B] 发现环2024-05-2423.P10298 [CCC 2024 S4] Painting Roads2024-05-24

24.F. Gardening Friends2024-06-14

25.D. Playoff Tournament2024-06-1926.E. Lomsat gelral2024-07-1227.F. Minimum Maximum Distance2024-07-1428.D. Book of Evil2024-07-1529.P2195 HXY造公园2024-07-1530.P3304 [SDOI2013] 直径2024-07-1531.D. Sasha and a Walk in the City2024-07-1932.D. Vitaly and Cycle2024-08-0133.P10838 『FLA - I』庭中有奇树2024-08-0734.F - Perfect Matching on a Tree2024-08-10

收起

原题链接

题解

最大深度·k-与节点1的距离·c
其中最大深度只要知道了节点1的最大深度，其子节点的最大深度可分类讨论得出

code

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

vector<ll> G[200005];
ll height1[200005] = {0};
ll height2[200005] = {0};
ll rec[200005] = {0};
ll cnt[200005] = {0};

inline void read(ll &x) {
	x = 0;
	ll flag = 1;
	char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-')flag = -1;
        c = getchar();
    }
	while(c >= '0' && c <= '9') {
		x = (x << 3) + (x << 1) + (c ^ 48);
		c = getchar();
	}
	x *= flag;
}

inline void write(ll x)
{
    if(x < 0){
    	putchar('-');
		x = -x;
	}
    if(x > 9)
		write(x / 10);
    putchar(x % 10 + '0');
}

void dfs1(ll now, ll fa)
{
    height1[now] = height2[now] = 0;
    for(auto next : G[now])
    {
        if(next == fa) continue;

        dfs1(next, now);
        if(height1[next] + 1 > height1[now])
        {
            height1[now] = height1[next] + 1;
        }
        else if(height1[next] + 1 > height2[now])
        {
            height2[now] = height1[next] + 1;
        }
    }
}

void dfs2(ll now, ll fa, ll op)
{
    rec[now] = height1[now];
    cnt[now] = op;
    for(auto next : G[now])
    {
        if(next == fa) continue;

        ll tem2 = height1[next];
        if(height1[next] + 1 == height1[now])
        {
            ll tem1 = height1[now];
            height1[next] = max(height1[next], height2[now] + 1);
            height1[now] = height2[now];
            dfs2(next, now, op + 1);
            height1[now] = tem1;
            height1[next] = tem2;
        }
        else
        {
            height1[next] = height1[now] + 1;
            dfs2(next, now, op + 1);
            height1[next] = tem2;
        }
    }
}

int main()
{
    ll t;
    read(t);
    while(t--)
    {
        ll n, k, c;
        read(n); read(k); read(c);
        for(ll i = 1; i < n; i++)
        {
            ll x, y;
            read(x); read(y);
            G[x].push_back(y);
            G[y].push_back(x);
        }

        dfs1(1, 1);
        dfs2(1, 1, 0);
        ll ans = 0;
        for(ll i = 1; i <= n; i++)
        {
            ans = max(ans, rec[i] * k - cnt[i] * c);
            G[i].clear();
        }
        write(ans);
        putchar('\n');
    }
    return 0;
}