CodeForces 1363E :Tree Shuffling 树形DP

传送门

题意

给你一棵以1为根的树，和每个点的a,b,c ，a代表操作的花费，b代表当前他的值，c代表目标值，每次你可以选一个点花费k*size两两交换他的子节点，问让所有值变成目标值的花费。

分析

树形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 cnt1[N],cnt0[N];
int a[N],b[N],c[N];
int n;
ll res;

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

void dfs(int u,int fa,int mi){
	mi = min(mi,a[u]);
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		dfs(j,u,mi);
		cnt1[u] += cnt1[j];
		cnt0[u] += cnt0[j];
	}
	if(b[u] != c[u]){
		if(b[u] == 1) cnt1[u]++;
		else cnt0[u]++;
	}
	if(mi == a[u]){
		ll s = min(cnt1[u],cnt0[u]);
		res += s * 2 * mi;
		cnt1[u] -= s,cnt0[u] -= s;
	}
}

int main() {
	memset(h,-1,sizeof h);
	read(n);
	for(int i = 1;i <= n;i++) read(a[i]),read(b[i]),read(c[i]);
	for(int i = 1;i < n;i++){
		int x,y;
		read(x),read(y);
		add(x,y),add(y,x);
	}
	dfs(1,0,INF);
	if(cnt1[1] || cnt0[1]) puts("-1");
	else dl(res);
}