Submission #1857134

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const llint big=1e15+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
int n;
vector<int>oya;
vector<vector<int>>ko;
vector<int>siz;
vector<llint>wa;
vector<llint>naga;
vector<pair<int,int>> henban;
int make_tree(int ter,int per){
	if(per!=-1){ko[ter].era(find(ko[ter].begin(),ko[ter].end(),per));}
	oya[ter]=per;
	int kos=1;
	for(auto it:ko[ter]){kos+=make_tree(it,ter);}
	siz[ter]=kos;
	return kos;
}
int main(void){
	int i;
	cin>>n;
	oya.res(n);
	ko.res(n);
	siz.res(n);
	wa.res(n);
	naga.res(n);
	henban.res(n-1);
	for(int i=0;i<n-1;i++){
		int a,b;cin>>a>>b;a--;b--;
		henban[i]=mp(a,b);
		ko[a].pub(b);
		ko[b].pub(a);
	}
	for(int i=0;i<n;i++){cin>>wa[i];}
	make_tree(0,-1);
	int wakaran=-1;
	for(i=1;i<n;i++){//0は親のため除く
		if(siz[i]+siz[i]==n){wakaran=i;continue;}
		naga[i]=(wa[i]-wa[oya[i]])/(n-siz[i]-siz[i]);
	}
	if(wakaran!=-1){
		llint nok=wa[wakaran];
		for(i=1;i<n;i++){nok-=siz[i]*naga[i];}
		int now=oya[wakaran];
		while(now!=0){nok-=(n-siz[now]-siz[now])*naga[now];now=oya[now];}
		naga[wakaran]=nok/(n/2);
	}
	for(i=0;i<n-1;i++){
		int a,b;a=henban[i].fir;b=henban[i].sec;
		if(oya[a]!=b){swap(a,b);}
		cout<<naga[a]<<endl;
	}
	return 0;
}

Submission Info

Judge Result