#731374 (C++17) No.1796 木上のクーロン

提出ソース

結果

問題	No.1796 木上のクーロン
ユーザー	heno239
提出日時	2022-01-16 11:21:57
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	4,985 ms / 10,000 ms
コード長	8,405 bytes
コンパイル時間	2,700 ms
コンパイル使用メモリ	181,696 KB
実行使用メモリ	58,208 KB
最終ジャッジ日時	2024-05-02 14:58:42
合計ジャッジ時間	33,425 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	15 ms 19,840 KB
testcase_01	AC	15 ms 19,840 KB
testcase_02	AC	15 ms 19,840 KB
testcase_03	AC	14 ms 19,712 KB
testcase_04	AC	14 ms 19,712 KB
testcase_05	AC	14 ms 19,840 KB
testcase_06	AC	15 ms 19,840 KB
testcase_07	AC	14 ms 19,840 KB
testcase_08	AC	15 ms 19,712 KB
testcase_09	AC	16 ms 19,968 KB
testcase_10	AC	16 ms 19,840 KB
testcase_11	AC	15 ms 19,840 KB
testcase_12	AC	15 ms 19,840 KB
testcase_13	AC	16 ms 19,968 KB
testcase_14	AC	15 ms 19,968 KB
testcase_15	AC	18 ms 19,968 KB
testcase_16	AC	18 ms 19,968 KB
testcase_17	AC	15 ms 19,968 KB
testcase_18	AC	15 ms 19,968 KB
testcase_19	AC	15 ms 19,840 KB
testcase_20	AC	214 ms 22,656 KB
testcase_21	AC	209 ms 22,524 KB
testcase_22	AC	441 ms 25,376 KB
testcase_23	AC	438 ms 25,372 KB
testcase_24	AC	700 ms 28,476 KB
testcase_25	AC	700 ms 28,348 KB
testcase_26	AC	1,004 ms 31,196 KB
testcase_27	AC	1,005 ms 31,700 KB
testcase_28	AC	4,985 ms 58,156 KB
testcase_29	AC	4,914 ms 58,208 KB
testcase_30	AC	452 ms 52,048 KB
testcase_31	AC	478 ms 49,684 KB
testcase_32	AC	1,170 ms 32,336 KB
testcase_33	AC	1,760 ms 55,540 KB
testcase_34	AC	1,686 ms 53,204 KB
testcase_35	AC	2,757 ms 40,540 KB
testcase_36	AC	2,799 ms 41,124 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
template<typename T>
void addv(vector<T>& v,int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
//-----------------------------------------


int get_premitive_root() {
	int primitive_root = 0;
	if (!primitive_root) {
		primitive_root = [&]() {
			set<int> fac;
			int v = mod - 1;
			for (ll i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;
			if (v > 1) fac.insert(v);
			for (int g = 1; g < mod; g++) {
				bool ok = true;
				for (auto i : fac) if (mod_pow(g, (mod - 1) / i) == 1) { ok = false; break; }
				if (ok) return g;
			}
			return -1;
		}();
	}
	return primitive_root;
}
const int proot = get_premitive_root();

typedef vector <modint> poly;
void dft(poly& f, bool inverse = false) {
	int n = f.size(); if (n == 1)return;

	static poly w{ 1 }, iw{ 1 };
	for (int m = w.size(); m < n / 2; m *= 2) {
		modint dw = mod_pow(proot, (mod - 1) / (4 * m)), dwinv = (modint)1 / dw;
		w.resize(m * 2); iw.resize(m * 2);
		for (int i = 0; i < m; i++)w[m + i] = w[i] * dw, iw[m + i] = iw[i] * dwinv;
	}
	if (!inverse) {
		for (int m = n; m >>= 1;) {
			for (int s = 0, k = 0; s < n; s += 2 * m, k++) {
				for (int i = s; i < s + m; i++) {
					modint x = f[i], y = f[i + m] * w[k];
					f[i] = x + y, f[i + m] = x - y;
				}
			}
		}
	}
	else {
		for (int m = 1; m < n; m *= 2) {
			for (int s = 0, k = 0; s < n; s += 2 * m, k++) {
				for (int i = s; i < s + m; i++) {
					modint x = f[i], y = f[i + m];
					f[i] = x + y, f[i + m] = (x - y) * iw[k];
				}
			}
		}
		modint n_inv = (modint)1 / (modint)n;
		for (modint& v : f)v *= n_inv;
	}
}
poly multiply(poly g, poly h) {
	int n = 1;
	int pi = 0, qi = 0;
	rep(i, g.size())if (g[i])pi = i;
	rep(i, h.size())if (h[i])qi = i;
	int sz = pi + qi + 2;
	while (n < sz)n *= 2;
	g.resize(n); h.resize(n);
	dft(g); dft(h);
	rep(i, n) {
		g[i] *= h[i];
	}
	dft(g, true);
	return g;
}

const int mn = 1 << 18;
vector<int> G[mn];
queue<vector<int>> q;
bool exi[mn];
int cq[mn];
modint coef[mn];
modint ans[mn];
void yaru(vector<int> v) {
	if (v.empty())return;
	//初期化
	for (int id : v)exi[id] = true;
	int g; int sz = v.size();

	function<int(int, int)> s_root = [&](int id, int fr)->int {
		int res = 1;
		int ma = 0;
		for (int to : G[id]) {
			if (to == fr)continue;
			if (!exi[to])continue;
			int nex = s_root(to, id);
			ma = max(ma, nex);
			res += nex;
		}
		if (ma <= sz / 2 && sz - res <= sz / 2)g = id;
		return res;
	};
	s_root(v[0], -1);
	//ここまで初期化

	poly al;
	//重心を根としてなんかやる
	function<void(int, int,int)> dfs = [&](int id, int fr,int dep) {
		if (!exi[id])return;
		addv(al, dep, (modint)cq[id]);
		for (int to : G[id]) {
			if (to == fr)continue;
			dfs(to, id,dep+1);
		}
	};
	addv(al, 0, (modint)cq[g]);
	for (int to : G[g])dfs(to, g,1);
	//modint s = 0;
	//rep(i, al.size())s += al[i] * coef[i];
	poly z(2*al.size());
	rep(i, z.size()) {
		z[z.size() - 1 - i] = coef[i];
	}
	poly almemo = multiply(al, z);
	int locmemo = z.size() - 1;
	ans[g] += almemo[locmemo];
	//assert(almemo[locmemo] == s);

	for (int to : G[g]) {
		if (!exi[to])continue;
		al.clear();
		dfs(to, g, 1);
		z.resize(2 * al.size());
		rep(i, z.size()) {
			z[z.size() - 1 - i] = coef[i];
		}
		poly cmemo = multiply(al, z);
		int loc = z.size() - 1;
		function<void(int, int, int)> cdfs = [&](int id, int fr, int dep) {
			if (!exi[id])return;
			modint val = 0;
			//if (locmemo >= dep)val += almemo[locmemo - dep];
			//if (loc >= dep)val -= cmemo[loc - dep];
			val = almemo[locmemo - dep] - cmemo[loc - dep];
			ans[id] += val;
			for (int to : G[id]) {
				if (to == fr)continue;
				cdfs(to, id, dep + 1);
			}
		};
		cdfs(to, g, 1);
	}
	//cout << g << " " << (modint)4 * ans[1] << "\n";

	//ここまで

	vector<vector<int>> chs;
	vector<int> nexs;
	function<void(int, int)> search_next = [&](int id, int fr) {
		if (!exi[id])return;
		nexs.push_back(id);
		for (int to : G[id]) {
			if (to == fr)continue;
			search_next(to, id);
		}
	};
	//子を列挙する
	for (int to : G[g]) {
		search_next(to, g);
		if (nexs.empty())continue;
		q.push(nexs);
		chs.push_back(nexs);
		nexs.clear();
	}
	//cout << g << " " << ans << "\n";
	//子達についてなんかやる

	for (int id : v)exi[id] = false;
}

void uoo(int n) {
	vector<int> ori(n); rep(i, n)ori[i] = i;
	q.push(ori);
	while (!q.empty()) {
		vector<int> v = q.front(); q.pop();
		yaru(v);
	}
}
void solve() {
	int n; cin >> n;
	rep(i, n)cin >> cq[i];
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	rep(i, n + 1) {
		coef[i] = (ll)(i + 1) * (i + 1);
		coef[i] = (modint)1 / coef[i];
	}
	uoo(n);
	modint z = 1;
	rep1(i, n)z *= i;
	z *= z;
	rep(i, n)ans[i] *= z;
	rep(i, n)cout << ans[i] << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//useexpr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード