【HDU 6567】 :Cotree 换根DP

匿枫

于 2021-11-17 23:09:17 发布

阅读量231

点赞数

分类专栏：大学ACM 文章标签：动态规划算法网络

本文链接：https://blog.csdn.net/tlyzxc/article/details/121390267

版权

大学ACM 专栏收录该内容

162 篇文章 5 订阅

订阅专栏

传送门

分析

首先我们知道，树上某点到树上其他点的距离和中，树的重心最小，所以这个问题就可以转化成找出两棵树的重心，链接，然后计算树上距离和
两棵树分类可以用并查集操作，后面两个步骤用换根DP就可以解决了

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],idx;
int sz[N];
int n;
int root;
int mx,zx;
ll ans = 0;
int q[N];

void add(int x,int y){
    ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

int find(int x){
    if(x != q[x]) q[x] = find(q[x]);
    return q[x];
}

void dfs(int u,int fa){
    sz[u] = 1;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u);
        sz[u] += sz[j];
    }
}

void dfs_(int u,int fa){
    int m = 0,sum = 0;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        sum += sz[j];
        m = max(m,sz[j]);
    }
    m = max(m,sz[root] - sum - 1);
    if(m < mx) mx = m,zx = u;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs_(j,u);
    }
}

int dfs2(int u,int fa){
    int sum = 0;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        int t = dfs2(j,u);
        ans += (1ll * t) * (1ll * (n - t));
        sum += t;
    }
    return sum + 1;
}

int main() {
    memset(h,-1,sizeof h);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++) q[i] = i;
    for(int i = 1;i <= n - 2;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        add(x,y),add(y,x);
        x = find(x),y = find(y);
        q[x] = y;
    }
    int root1 = 0,root2 = 0;
    for(int i = 1;i <= n;i++){
        if(!root1) root1 = find(i);
        else if(root1 != find(i)) root2 = find(i);
        if(root1 && root2) break;
    }
    mx = INF,zx = 0;
    root = root1;
    dfs(root1,0);
    dfs_(root1,0);
    int x = zx;
    mx = INF,zx = 0;
    root = root2;
    dfs(root2,0);
    dfs_(root2,0);
    add(x,zx),add(zx,x);
    dfs2(1,0);
    dl(ans);
    return 0;
}