E. Tree Shuffling
题意:
根节点为1的树上,每个节点都有对应的费用,拥有值和目标值,通过消耗节点数量*他们的父节点的费用可以交换几个节点的拥有值,问让所有的结点的值变为他们的目标值
思路:
vector建树后DFS暴力求值,因为要值最小,所以如果一个点的父节点的费用值如果小于它本身的费用值的话,那它的费用值就等于父节点的费用值(即把更小的费用值向下传递),最后再判断一下需要交换的0的数量和1的数量相不相等,不相等就输出-1
代码附上:
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
const ll N = 2e5+10;
ll ans=0;
struct node
{
ll cost;
bool a,b;
} tree[N];
vector<ll>vc[N];
ll DFS(ll Pos,ll fa)
{
ll pos=0,nag=0;
if(tree[Pos].a>tree[Pos].b)
pos=1;
else if(tree[Pos].a<tree[Pos].b)
nag=1;
for(ll i=0; i<vc[Pos].size(); ++i)
{
ll now=vc[Pos][i];
if(now==fa)
continue;
tree[now].cost=min(tree[now].cost,tree[Pos].cost);
ll k=DFS(now,Pos);
if(k>0)
pos+=k;
else
nag-=k;
}
ans+=min(pos,nag)*tree[Pos].cost*2;
return pos-nag;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n,u,v;
cin>>n;
for(ll i=1; i<=n; ++i)
cin>>tree[i].cost>>tree[i].a>>tree[i].b;
for(ll i=1; i<n; ++i)
{
cin>>u>>v;
vc[u].push_back(v);
vc[v].push_back(u);
}
if(DFS(1,0))
cout<<-1;
else
cout<<ans;
return 0;
}