結果

問題 No.1796 木上のクーロン
ユーザー HIR180HIR180
提出日時 2021-12-25 20:56:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,009 ms / 10,000 ms
コード長 5,976 bytes
コンパイル時間 6,092 ms
コンパイル使用メモリ 247,952 KB
実行使用メモリ 58,464 KB
最終ジャッジ日時 2024-09-22 02:05:32
合計ジャッジ時間 32,488 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
11,264 KB
testcase_01 AC 45 ms
11,392 KB
testcase_02 AC 44 ms
11,136 KB
testcase_03 AC 44 ms
11,264 KB
testcase_04 AC 44 ms
11,520 KB
testcase_05 AC 45 ms
11,392 KB
testcase_06 AC 44 ms
11,392 KB
testcase_07 AC 44 ms
11,264 KB
testcase_08 AC 45 ms
11,392 KB
testcase_09 AC 46 ms
11,264 KB
testcase_10 AC 45 ms
11,392 KB
testcase_11 AC 45 ms
11,392 KB
testcase_12 AC 45 ms
11,392 KB
testcase_13 AC 46 ms
11,392 KB
testcase_14 AC 45 ms
11,520 KB
testcase_15 AC 47 ms
11,648 KB
testcase_16 AC 46 ms
11,264 KB
testcase_17 AC 45 ms
11,392 KB
testcase_18 AC 45 ms
11,392 KB
testcase_19 AC 45 ms
11,392 KB
testcase_20 AC 200 ms
15,872 KB
testcase_21 AC 200 ms
16,000 KB
testcase_22 AC 421 ms
20,204 KB
testcase_23 AC 445 ms
20,096 KB
testcase_24 AC 699 ms
24,412 KB
testcase_25 AC 703 ms
24,804 KB
testcase_26 AC 1,072 ms
30,156 KB
testcase_27 AC 1,115 ms
30,156 KB
testcase_28 AC 2,918 ms
58,464 KB
testcase_29 AC 3,009 ms
55,864 KB
testcase_30 AC 368 ms
28,432 KB
testcase_31 AC 457 ms
28,500 KB
testcase_32 AC 1,384 ms
30,452 KB
testcase_33 AC 1,978 ms
42,044 KB
testcase_34 AC 2,073 ms
39,752 KB
testcase_35 AC 2,304 ms
45,348 KB
testcase_36 AC 2,372 ms
43,576 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <atcoder/convolution>
using namespace std;
using namespace atcoder;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
 
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
vc<int>edge[250005];
bool rem[250005];
P farch[250005];
ll ans[250005];
ll dist[250005];
int num[250005];
int rev[250005];
int up[250005];
P make(int v, int u, int d){
	up[v] = u;
	farch[v] = mp(d, v);
	for(int i=0;i<edge[v].size();i++){
		int v2=edge[v][i];
		if(rem[v2] || v2==u) continue;
		auto x = make(v2,v,d+1);
		chmax(farch[v], x);
	}
	return farch[v];
}
vc<int>zan;
int C;
void dfs2(int v,int u,ll L){
	dist[v] = L;
	zan.pb(v);
	ans[v] += num[C] * rev[L+1] % mod * (mod+1) / 2 % mod;
	ans[C] += num[v] * rev[L+1] % mod * (mod+1) / 2 % mod;
	for(int i=0;i<edge[v].size();i++){
		if(edge[v][i] == u) continue;
		if(rem[edge[v][i]]) continue;
		dfs2(edge[v][i], v, L+1);
	}
}
void sol(int v){
	auto z = make(v,-1,0);
	z = make(z.b,-1,0);
	int cent=z.b;
	rep(_, z.a/2) cent = up[cent];
	ans[cent] += num[cent];
	
	rem[cent]=true;
	C = cent;
	vc<int>cur((z.a+1)/2+1, 0);
	int all = (z.a+1)/2;
	vc<int>igata;
	
	int pre = 0;
	for(int i=0;i<edge[cent].size();i++)
	{
		if(rem[edge[cent][i]]) continue;
		zan.clear();
		dfs2(edge[cent][i],cent,1);
		int mx = 0;
		for(auto v:zan) chmax(mx, dist[v]);
		if(igata.size() < pre+mx+1){
			int sz = igata.size();
			igata.resize(pre+mx+1);
			for(int p=sz;p<=pre+mx;p++) igata[p] = (rev[p+1]);
		}
		chmax(pre, mx);
		auto now = convolution(igata, cur);
		
		for(auto v:zan){
			add(cur[all - dist[v]], num[v]);
			ans[v] += now[all+dist[v]];
		}
		
	}
	for(auto &e:cur) e = 0;
	igata.clear();
	pre = 0;
	
	for(int i=edge[cent].size()-1;i>=0;i--)
	{
		if(rem[edge[cent][i]]) continue;
		zan.clear();
		dfs2(edge[cent][i],cent,1);
		int mx = 0;
		for(auto v:zan) chmax(mx, dist[v]);
		if(igata.size() < pre+mx+1){
			int sz = igata.size();
			igata.resize(pre+mx+1);
			for(int p=sz;p<=pre+mx;p++) igata[p] = (rev[p+1]);
		}
		chmax(pre, mx);
		auto now = convolution(igata, cur);
		
		for(auto v:zan){
			add(cur[all - dist[v]], num[v]);
			ans[v] += now[all+dist[v]];
		}
		
	}
	for(int i=0;i<edge[cent].size();i++) if(!rem[edge[cent][i]]) sol(edge[cent][i]);
	rem[cent]=false;
}

void solve(){
	rep(i, 250000) rev[i] = modpow(i, 2*mod-4);
	int n; cin >> n;
	repn(i, n) cin >> num[i];
	rep(i, n-1){
		int u, v; cin >> u >> v;
		edge[u].pb(v);
		edge[v].pb(u);
	}
	repn(i, n) shuffle(edge[i].begin(), edge[i].end(), mt);
	sol(1);
	int k0 = 1;
	repn(i, n){
		k0 = k0*i%mod*i%mod;
	}
	repn(i, n){
		ans[i] = (ans[i]%mod+mod)%mod*k0%mod;
		o(ans[i]);
	}
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}
0