JZOJ 3519. 【NOIP2013模拟11.6A组】灵能矩阵(pylon)

版权声明：喜欢请点个大拇指，感谢各位dalao。弱弱说下，转载要出处呦 https://blog.csdn.net/qq_35786326/article/details/85212930

---

题目：

传送门

---

分析：

---

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring> 
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define ch cheap
using namespace std;
inline LL read() {
    LL d=0,f=1;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
    return d*f;
}
LL min(LL x,LL y) {return x>y?y:x;}
LL w[100005],ls[200005],cnt,ans=0;
struct node{
	LL to,next;
}e[200005];
void add(LL x,LL y)
{
	e[cnt]=(node){y,ls[x]};
	ls[x]=cnt++;
	return;
}
LL lcm(LL x,LL y) {return x*y/(__gcd(x,y));}
LL s[100005];
void dg(LL x)
{
	LL minv=999999999999999ll,king=0,www=1,c=0;
	for(LL i=ls[x];~i;i=e[i].next)
	{
		LL v=e[i].to;
		dg(v);
		www=lcm(www,s[v]);	
		minv=min(minv,w[v]);
		c+=w[v];
		king++;
	}
	if(!c) s[x]=1; 
	else 
	{
		s[x]=www*king;
		LL m;
		m=minv-minv%www;
		ans+=c-m*king;
		w[x]=m*king;
	}
	return;
}
int main()
{
	freopen("pylon.in","r",stdin);
	freopen("pylon.out","w",stdout);
	memset(ls,-1,sizeof(ls));
	LL n=read();
	for(LL i=1;i<=n;i++) w[i]=read();
	for(LL i=1;i<n;i++)
	{
		LL a=read(),b=read();
		add(a,b);
	}
	dg(1);
	cout<<ans;
	return 0;
}