Codeforces Round #722 (Div. 1) - A. Parsa‘s Humongous Tree

最新推荐文章于 2024-06-01 23:14:10 发布

wobushihaorenF

最新推荐文章于 2024-06-01 23:14:10 发布

阅读量205

点赞数

分类专栏：树形DP 文章标签：深度优先算法

本文链接：https://blog.csdn.net/aaa7888210/article/details/129295169

版权

树形DP 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

树形DP

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=998244353;
int rnd(int x) {return mrand()%x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(int a,int b){return a*b/gcd(a,b);}

void solve(){
	int n;
	cin>>n;
	vector<VI> g(n);
	vector<ll> l(n),r(n);
	vector<array<ll,2>> dp(n);
	rep(i,0,n) cin>>l[i]>>r[i];
	rep(i,1,n){
		int x,y;
		cin>>x>>y;
		x--,y--;
		g[x].pb(y);
		g[y].pb(x);
	}
	auto dfs=[&](auto self,int x,int fa)->void{
		for(auto y:g[x]){
			if(y==fa) continue;
			self(self,y,x);
			dp[x][0]+=max(dp[y][1]+abs(l[x]-r[y]),dp[y][0]+abs(l[x]-l[y]));
			dp[x][1]+=max(dp[y][0]+abs(l[y]-r[x]),dp[y][1]+abs(r[y]-r[x]));
		}
	};
	dfs(dfs,0,-1);
	cout<<max(dp[0][0],dp[0][1])<<'\n';
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}