結果

問題 No.2949 Product on Tree
ユーザー ゆにぽけゆにぽけ
提出日時 2024-10-25 21:47:36
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 361 ms / 2,000 ms
コード長 3,585 bytes
コンパイル時間 1,820 ms
コンパイル使用メモリ 138,972 KB
実行使用メモリ 34,828 KB
最終ジャッジ日時 2024-10-25 21:48:23
合計ジャッジ時間 18,727 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 303 ms
16,284 KB
testcase_04 AC 301 ms
15,992 KB
testcase_05 AC 287 ms
16,400 KB
testcase_06 AC 294 ms
16,456 KB
testcase_07 AC 285 ms
16,096 KB
testcase_08 AC 287 ms
16,740 KB
testcase_09 AC 311 ms
17,024 KB
testcase_10 AC 295 ms
17,504 KB
testcase_11 AC 287 ms
18,336 KB
testcase_12 AC 331 ms
21,432 KB
testcase_13 AC 316 ms
22,292 KB
testcase_14 AC 299 ms
24,172 KB
testcase_15 AC 298 ms
27,224 KB
testcase_16 AC 317 ms
24,864 KB
testcase_17 AC 305 ms
25,784 KB
testcase_18 AC 313 ms
25,440 KB
testcase_19 AC 339 ms
28,224 KB
testcase_20 AC 304 ms
27,560 KB
testcase_21 AC 339 ms
27,928 KB
testcase_22 AC 297 ms
29,356 KB
testcase_23 AC 320 ms
16,624 KB
testcase_24 AC 298 ms
16,612 KB
testcase_25 AC 294 ms
16,584 KB
testcase_26 AC 316 ms
16,588 KB
testcase_27 AC 306 ms
16,600 KB
testcase_28 AC 314 ms
16,852 KB
testcase_29 AC 299 ms
17,144 KB
testcase_30 AC 321 ms
17,900 KB
testcase_31 AC 303 ms
19,328 KB
testcase_32 AC 325 ms
19,668 KB
testcase_33 AC 314 ms
24,312 KB
testcase_34 AC 337 ms
29,808 KB
testcase_35 AC 314 ms
26,100 KB
testcase_36 AC 357 ms
31,828 KB
testcase_37 AC 333 ms
32,392 KB
testcase_38 AC 340 ms
28,544 KB
testcase_39 AC 324 ms
29,128 KB
testcase_40 AC 339 ms
34,264 KB
testcase_41 AC 312 ms
30,972 KB
testcase_42 AC 361 ms
34,828 KB
testcase_43 AC 152 ms
13,788 KB
testcase_44 AC 155 ms
13,988 KB
testcase_45 AC 225 ms
16,964 KB
testcase_46 AC 178 ms
15,388 KB
testcase_47 AC 131 ms
12,052 KB
testcase_48 AC 186 ms
15,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
#include <chrono>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	static constexpr int get_mod() noexcept {return m;}
	static constexpr int primitive_root() noexcept
	{
		assert(m == 998244353);
		return 3;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
/* using mint = modint<1000000007>; */


void Main()
{
	int N;
	cin >> N;
	vector<int> A(N);
	for(int i = 0;i < N;i++)
	{
		cin >> A[i];
	}
	vector<vector<int>> G(N);
	for(int i = 1;i < N;i++)
	{
		int u, v;
		cin >> u >> v;
		u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}

	vector<mint> P(N, 1), S(N);
	mint ans = 0;
	auto dfs = [&](auto dfs, int u,int p) -> void
	{
		if(p != -1)
		{
			P[u] = P[p];
		}
		if(A[u] != 0)
		{
			P[u] *= A[u];
		}
		mint pro_sum = 0;
		for(int v : G[u])
		{
			if(v == p)
			{
				continue;
			}
			dfs(dfs, v, u);
			pro_sum += S[u] * S[v];
			S[u] += S[v];
		}
		if(A[u] != 0)
		{
			ans += (pro_sum / (P[u] * P[u]) + S[u] / P[u]) * A[u];
			S[u] += P[u];
		}
		else
		{
			S[u] = 0;
		}
	};
	dfs(dfs, 0, -1);
	cout << ans << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}
0