結果
| 問題 | No.3412 Christmas Tree Coloring |
| コンテスト | |
| ユーザー |
 ecottea
|
| 提出日時 | 2025-12-20 17:17:06 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 681 ms / 2,000 ms |
| コード長 | 29,250 bytes |
| 記録 | |
| コンパイル時間 | 7,181 ms |
| コンパイル使用メモリ | 320,732 KB |
| 実行使用メモリ | 22,744 KB |
| 最終ジャッジ日時 | 2025-12-20 17:17:25 |
| 合計ジャッジ時間 | 16,993 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 20 |
ソースコード
#ifndef HIDDEN_IN_VS // 折りたたみ用
// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS
// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;
// 型名の短縮
using ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
// 定数の定義
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定
// 汎用関数の定義
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod
// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif // 折りたたみ用
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<(int)1e9+7>;
//using mint = modint; // mint::set_mod(m);
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
int mute_dump = 0;
int frac_print = 0;
#if __has_include(<atcoder/all>)
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
#endif
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_math(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); rep(i,9)cout<<MLE[i]; } } // RE の代わりに MLE を出す
#endif
//【任意数列の列挙（上限指定）】O(ub^n)
/*
* 数列 a[0..n) で，∀i, a[i]∈[0..ub) を満たすもの全てを格納したリストを返す．
*/
vvi enumerate_all_sequences(int n, int ub) {
// verify : https://yukicoder.me/problems/no/2917
vvi seqs;
vi seq(n); // 作成途中の列
function<void(int)> rf = [&](int i) {
// 完成していれば記録する．
if (i == n) {
seqs.push_back(seq);
return;
}
rep(x, ub) {
seq[i] = x;
rf(i + 1);
}
};
rf(0);
return seqs;
}
// n 頂点の森 g に対する愚直解を返す．
mint naive_forest(int n, Graph g) {
// ------------------ 辺 (u[j]-v[j]) のリストに直す ------------------
vi u, v;
rep(s, n) repe(t, g[s]) {
if (s < t) {
u.push_back(s);
v.push_back(t);
}
}
int m = sz(u);
// -------------------------------------------------------------------
mint res = 0;
repe(col, enumerate_all_sequences(n, 3)) {
vi cnt(3);
rep(i, n) cnt[col[i]]++;
if (cnt[0] == 0) continue;
if (cnt[1] == 0) continue;
if (cnt[2] != 1) continue;
bool ok = true;
rep(j, m) if (col[u[j]] == col[v[j]]) ok = false;
if (ok) res++;
}
return res;
}
// 仮根 0 をもつ n 頂点の木 g に対する愚直解を返す．
mint naive_virtual_tree(int n, Graph g) {
mint res = 0;
// set : 黒で塗る頂点の集合
repb(set, n) {
// 根は黒で塗れないとする．
if (getb(set, 0)) continue;
bool ok = true;
rep(s, n) repe(t, g[s]) if (getb(set, s) && getb(set, t)) ok = false;
if (ok) res++;
}
return res;
}
// 頂点 0 を virtual な根とする木 par に対する愚直解を計算する．
// virtual な根を考えたくなければ，頂点 0 と接続辺を無視して森として扱えばいい．
mint naive(const vi& par) {
// 森として扱う
if (1) {
int n = sz(par);
Graph g(n);
rep(i, n) {
if (par[i] == 0) continue;
g[i].push_back(par[i] - 1);
g[par[i] - 1].push_back(i);
}
return naive_forest(n, g);
}
// 仮根をもつ木として扱う
else {
int n = sz(par) + 1;
Graph g(n);
rep(i, n - 1) {
g[i + 1].push_back(par[i]);
g[par[i]].push_back(i + 1);
}
return naive_virtual_tree(n, g);
}
}
//【グラフの入力】O(n + m)
Graph read_Graph(int n, int m = -1, bool directed = false, bool zero_indexed = false) {
Graph g(n);
if (m == -1) m = n - 1;
rep(j, m) {
int a, b;
cin >> a >> b;
if (!zero_indexed) { --a; --b; }
g[a].push_back(b);
if (!directed && a != b) g[b].push_back(a);
}
return g;
}
// (グラフ, 根) を naive() への入力形式に直す．
vi inputform(const Graph& g, int r) {
int n = sz(g);
vi par(n);
function<void(int, int)> dfs = [&](int s, int p) {
par[s] = { p + 1 };
repe(t, g[s]) {
if (t == p) continue;
dfs(t, s);
}
};
dfs(r, -1);
return par;
}
//【行列】
template <class T>
struct Matrix {
int n, m; // 行列のサイズ（n 行 m 列）
vector<vector<T>> v; // 行列の成分
// n×m 零行列で初期化する．
Matrix(int n, int m) : n(n), m(m), v(n, vector<T>(m)) {}
// n×n 単位行列で初期化する．
Matrix(int n) : n(n), m(n), v(n, vector<T>(n)) { rep(i, n) v[i][i] = T(1); }
// 二次元配列 a[0..n)[0..m) の要素で初期化する．
Matrix(const vector<vector<T>>& a) : n(sz(a)), m(sz(a[0])), v(a) {}
Matrix() : n(0), m(0) {}
// 代入
Matrix(const Matrix&) = default;
Matrix& operator=(const Matrix&) = default;
// アクセス
inline vector<T> const& operator[](int i) const { return v[i]; }
inline vector<T>& operator[](int i) {return v[i];}
// 入力
friend istream& operator>>(istream& is, Matrix& a) {
rep(i, a.n) rep(j, a.m) is >> a.v[i][j];
return is;
}
// 行の追加
void push_back(const vector<T>& a) {
Assert(sz(a) == m);
v.push_back(a);
n++;
}
// 行の削除
void pop_back() {
Assert(n > 0);
v.pop_back();
n--;
}
// サイズ変更
void resize(int n_) {
v.resize(n_);
n = n_;
}
void resize(int n_, int m_) {
n = n_;
m = m_;
v.resize(n);
rep(i, n) v[i].resize(m);
}
// 空か
bool empty() const { return min(n, m) == 0; }
// 比較
bool operator==(const Matrix& b) const { return n == b.n && m == b.m && v == b.v; }
bool operator!=(const Matrix& b) const { return !(*this == b); }
// 加算，減算，スカラー倍
Matrix& operator+=(const Matrix& b) {
rep(i, n) rep(j, m) v[i][j] += b[i][j];
return *this;
}
Matrix& operator-=(const Matrix& b) {
rep(i, n) rep(j, m) v[i][j] -= b[i][j];
return *this;
}
Matrix& operator*=(const T& c) {
rep(i, n) rep(j, m) v[i][j] *= c;
return *this;
}
Matrix operator+(const Matrix& b) const { return Matrix(*this) += b; }
Matrix operator-(const Matrix& b) const { return Matrix(*this) -= b; }
Matrix operator*(const T& c) const { return Matrix(*this) *= c; }
friend Matrix operator*(const T& c, const Matrix<T>& a) { return a * c; }
Matrix operator-() const { return Matrix(*this) *= T(-1); }
// 行列ベクトル積 : O(m n)
vector<T> operator*(const vector<T>& x) const {
vector<T> y(n);
rep(i, n) rep(j, m) y[i] += v[i][j] * x[j];
return y;
}
// ベクトル行列積 : O(m n)
friend vector<T> operator*(const vector<T>& x, const Matrix& a) {
vector<T> y(a.m);
rep(i, a.n) rep(j, a.m) y[j] += x[i] * a[i][j];
return y;
}
// 積：O(n^3)
Matrix operator*(const Matrix& b) const {
Matrix res(n, b.m);
rep(i, res.n) rep(k, m) rep(j, res.m) res[i][j] += v[i][k] * b[k][j];
return res;
}
Matrix& operator*=(const Matrix& b) { *this = *this * b; return *this; }
// 累乗：O(n^3 log d)
Matrix pow(ll d) const {
Matrix res(n), pow2 = *this;
while (d > 0) {
if (d & 1) res *= pow2;
pow2 *= pow2;
d >>= 1;
}
return res;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Matrix& a) {
rep(i, a.n) {
os << "[";
rep(j, a.m) os << a[i][j] << " ]"[j == a.m - 1];
if (i < a.n - 1) os << "\n";
}
return os;
}
#endif
};
//【行簡約形（行交換なし）】O(n m min(n, m))
template <class T>
vector<pii> row_reduced_form(Matrix<T>& A) {
int n = A.n, m = A.m;
vector<pii> piv;
piv.reserve(min(n, m));
// 未確定の列を記録しておくリスト
list<int> rjs;
rep(j, m) rjs.push_back(j);
rep(i, n) {
// 第 i 行の係数を左から走査し非 0 を見つける．
auto it = rjs.begin();
for (; it != rjs.end(); it++) if (A[i][*it] != 0) break;
// 第 i 行の全てが 0 なら無視する．
if (it == rjs.end()) continue;
// A[i][j] をピボットに選択する．
int j = *it;
rjs.erase(it);
piv.emplace_back(i, j);
// A[i][j] が 1 になるよう行全体を A[i][j] で割る．
T Aij_inv = T(1) / A[i][j];
repi(j2, j, m - 1) A[i][j2] *= Aij_inv;
// 第 i 行以外の第 j 列の成分が全て 0 になるよう第 i 行を定数倍して減じる．
rep(i2, n) if (A[i2][j] != 0 && i2 != i) {
T mul = A[i2][j];
repi(j2, j, m - 1) A[i2][j2] -= A[i][j2] * mul;
}
}
return piv;
}
//【逆行列】O(n^3)
template <class T>
Matrix<T> inverse_matrix(const Matrix<T>& mat) {
int n = mat.n;
// 元の行列 mat と単位行列を繋げた拡大行列 v を作る．
vector<vector<T>> v(n, vector<T>(2 * n));
rep(i, n) rep(j, n) {
v[i][j] = mat[i][j];
if (i == j) v[i][n + j] = 1;
}
int m = 2 * n;
// 注目位置を (i, j)（i 行目かつ j 列目）とする．
int i = 0, j = 0;
// 拡大行列に対して行基本変形を行い，左側を単位行列にすることを目指す．
while (i < n && j < m) {
// 同じ列の下方の行から非 0 成分を見つける．
int i2 = i;
while (i2 < n && v[i2][j] == T(0)) i2++;
// 見つからなかったら全て 0 の列があったので mat は非正則
if (i2 == n) return Matrix<T>();
// 見つかったら i 行目とその行を入れ替える．
if (i != i2) swap(v[i], v[i2]);
// v[i][j] が 1 になるよう行全体を v[i][j] で割る．
T vij_inv = T(1) / v[i][j];
repi(j2, j, m - 1) v[i][j2] *= vij_inv;
// v[i][j] と同じ列の成分が全て 0 になるよう i 行目を定数倍して減じる．
rep(i2, n) {
// i 行目だけは引かない．
if (i2 == i) continue;
T mul = v[i2][j];
repi(j2, j, m - 1) v[i2][j2] -= v[i][j2] * mul;
}
// 注目位置を右下に移す．
i++; j++;
}
// 拡大行列の右半分が mat の逆行列なのでコピーする．
Matrix<T> mat_inv(n, n);
rep(i, n) rep(j, n) mat_inv[i][j] = v[i][n + j];
return mat_inv;
}
//【根付き木の同型類】O(n log n)
vi rooted_tree_classification(const Graph& g, int r) {
int n = sz(g);
static map<vi, int> to_id;
vi id(n);
function<int(int s, int p)> dfs = [&](int s, int p) {
vi ch;
repe(t, g[s]) {
if (t == p) continue;
ch.push_back(dfs(t, s));
}
sort(all(ch));
if (to_id.count(ch)) id[s] = to_id[ch];
else id[s] = to_id[ch] = sz(to_id);
return id[s];
};
dfs(r, -1);
return id;
}
// 遷移行列の係数を計算し，埋め込み用のコードを出力する．
// 待てない場合は lv_max や LB_max を指定する．
void embed_coefs(int lv_max = INF, int LB_max = INF) {
using TREE = vi; // 木は親の列 p[1..n) で表す．
vector<TREE> trees{ {} };
int idx = 0;
int ID = -1;
int PDIM = -1;
repi(lv, 1, INF) {
dump("----------- lv:", lv, "--------------");
// 上用の木（位置指定子追加）と下用の木（そのまま）に整形する．
vector<TREE> treesT, treesB(trees);
rep(i, idx) repi(p, 0, sz(trees[i])) {
treesT.push_back(trees[i]);
treesT.back().push_back(p);
}
int LT = sz(treesT); int LB = min(sz(treesB), LB_max);
dump("LT:", LT, "LB:", LB);
// (i,j) 成分が naive(treesT[i] join treesB[j]) であるような行列 mat を得る．
Matrix<mint> mat(LT, LB);
rep(i, LT) rep(j, LB) {
TREE tree(treesT[i]);
int p0 = tree.back();
tree.pop_back();
int offset = sz(tree);
repe(p, treesB[j]) {
int np = (p == 0 ? p0 : p + offset);
tree.push_back(np);
}
mat[i][j] = naive(tree);
}
//dump("mat:"); dump(mat);
// mat に対して行基本変形を行いピボット位置のリスト piv を得る．
auto piv = row_reduced_form(mat);
int DIM = sz(piv);
dump("piv(", DIM, "):"); dump(piv);
// rank の更新がなかったら必要な情報は揃ったとみなして打ち切る（たまにミスる）
if (lv == lv_max || (DIM > 0 && DIM == PDIM)) {
// 選択した行と列をそれぞれ昇順に並べて is, js とする（0 始まりのはず）
vi is(DIM), js(DIM);
rep(r, DIM) tie(is[r], js[r]) = piv[r];
sort(all(js));
// js : 本質的に区別しなければならない木のリスト
// is : js を区別するのに必要最低限の接ぎ木のリスト
// 基底の変換行列 P を得る．
Matrix<mint> P(DIM, DIM);
rep(i_, DIM) rep(j_, DIM) {
int i = is[i_];
int j = js[j_];
TREE tree(treesT[i]);
int p0 = tree.back();
tree.pop_back();
int offset = sz(tree);
repe(p, treesB[j]) {
int np = (p == 0 ? p0 : p + offset);
tree.push_back(np);
}
P[i_][j_] = naive(tree);
}
// P の逆行列 P_inv を得る．
auto P_inv = inverse_matrix(P);
// apply の表現行列を得る．
Matrix<mint> apply(DIM, DIM);
rep(i_, DIM) rep(j_, DIM) {
int i = is[i_];
int j = js[j_];
TREE tree(treesT[i]);
int offset = sz(tree);
repe(p, treesB[j]) {
int np = p + offset;
tree.push_back(np);
}
apply[i_][j_] = naive(tree);
}
apply = P_inv * apply;
// merge の表現テンソルを得る．
vvvm merge(DIM, vvm(DIM, vm(DIM)));
rep(j1_, DIM) rep(j2_, DIM) {
if (j1_ > j2_) {
// 子の順序は無視する．
rep(i_, DIM) {
merge[j1_][j2_][i_] = merge[j2_][j1_][i_];
}
}
else {
rep(i_, DIM) {
int i = is[i_];
int j1 = js[j1_];
int j2 = js[j2_];
TREE tree(treesT[i]);
int p0 = tree.back();
tree.pop_back();
int offset = sz(tree);
repe(p, treesB[j1]) {
int np = (p == 0 ? p0 : p + offset);
tree.push_back(np);
}
offset = sz(tree);
repe(p, treesB[j2]) {
int np = (p == 0 ? p0 : p + offset);
tree.push_back(np);
}
merge[j1_][j2_][i_] = naive(tree);
}
merge[j1_][j2_] = P_inv * merge[j1_][j2_];
}
}
// 根を閉じるためのベクトルを得る．
vm vecP(DIM);
rep(i, DIM) vecP[i] = P[0][i];
// 埋め込み用の文字列を出力する．
auto to_signed_string = [](mint x) {
int v = x.val();
int mod = mint::mod();
if (v > mod / 2) v -= mod;
return to_string(v);
};
string eb;
eb += "constexpr int DIM = ";
eb += to_string(DIM);
eb += ";\n";
eb += "VTYPE matA[DIM][DIM] = {";
rep(i, DIM) {
eb += "{";
rep(j, DIM) eb += to_signed_string(apply[i][j]) + ",";
eb.pop_back();
eb += "},";
}
eb.pop_back();
eb += "};\n";
eb += "VTYPE tsrM[DIM][DIM][DIM] = {";
rep(i, DIM) {
eb += "{";
rep(j1, DIM) {
eb += "{";
rep(j2, DIM) eb += to_signed_string(merge[j1][j2][i]) + ",";
eb.pop_back();
eb += "},";
}
eb.pop_back();
eb += "},";
}
eb.pop_back();
eb += "};\n";
eb += "VTYPE vecP[DIM] = {";
rep(j, DIM) eb += to_signed_string(vecP[j]) + ",";
eb.pop_back();
eb += "};\n";
cout << eb;
exit(0);
}
// 基底ガチャ
//mt19937_64 mt((int)time(NULL)); shuffle(trees.begin() + idx, trees.end(), mt);
// 次に大きい木たちを trees に追加する．
int nidx = sz(trees);
repi(i, idx, nidx - 1) rep(p, lv) {
trees.push_back(trees[i]);
trees.back().push_back(p);
Graph g(lv + 1);
rep(j, lv) {
g[j + 1].push_back(trees.back()[j]);
g[trees.back()[j]].push_back(j + 1);
}
auto hash = rooted_tree_classification(g, 0);
if (hash[0] <= ID) {
trees.pop_back();
continue;
}
ID = hash[0];
}
idx = nidx;
PDIM = DIM;
}
}
template <class VTYPE>
vector<VTYPE> solve(const Graph& g, int r) {
// --------------- embed_coefs() からの出力を貼る ----------------
constexpr int DIM = 9;
vvm matA = { {0,0,0,0,0,0,0,0,0},{1,0,0,0,0,0,0,0,0},{0,0,0,-499122176,-4,-499122176,499122174,-11,499122173},{0,1,0,499122176,499122176,499122175,499122176,499122175,-2},{0,0,0,499122176,-499122169,499122176,-499122171,-499122156,7},{0,0,0,1,-3,1,-2,-8,-2},{0,0,1,-499122176,-499122175,-499122175,-499122176,-499122174,2},{0,0,0,0,499122173,0,-3,499122167,499122173},{0,0,0,0,3,0,3,8,3} };
vvvm tsrM = { {{1,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}},{{0,1,0,0,0,0,0,0,0},{1,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}},{{0,0,1,0,0,0,0,0,0},{0,1,0,0,0,0,-1,1,499122176},{1,0,0,0,1,499122176,-3,2,-3},{0,0,0,-499122174,499122176,1,-1,-3,499122174},{0,0,1,499122176,2,-3,499122169,-1,499122165},{0,0,499122176,1,-3,499122174,499122172,499122165,-11},{0,-1,-3,-1,499122169,499122172,499122172,-18,-12},{0,1,2,-3,-1,499122165,-18,-20,-36},{0,499122176,-3,499122174,499122165,-11,-12,-36,499122145}},{{0,0,0,1,0,0,0,0,0},{0,0,0,0,0,0,499122176,-499122176,249561089},{0,0,0,0,-499122176,249561089,-499122176,3,-499122173},{1,0,0,249561087,249561089,499122176,-1,-499122173,249561090},{0,0,-499122176,249561089,3,-499122173,-249561085,-499122165,-249561077},{0,0,249561089,499122176,-499122173,249561090,249561089,-249561077,-499122169},{0,499122176,-499122176,-1,-249561085,249561089,-249561089,10,5},{0,-499122176,3,-499122173,-499122165,-249561077,10,36,31},{0,249561089,-499122173,249561090,-249561077,-499122169,5,31,-249561067}},{{0,0,0,0,1,0,0,0,0},{0,0,1,0,0,0,-499122174,499122174,249561090},{0,1,0,0,499122174,249561090,-499122169,-3,-499122167},{0,0,0,249561084,249561090,499122176,3,-499122167,249561097},{1,0,499122174,249561090,-3,-499122167,-249561069,-499122166,-249561054},{0,0,249561090,499122176,-499122167,249561097,249561100,-249561054,-499122145},{0,-499122174,-499122169,3,-249561069,249561100,-249561078,47,31},{0,499122174,-3,-499122167,-499122166,-249561054,47,72,103},{0,249561090,-499122167,249561097,-249561054,-499122145,31,103,-249561002}},{{0,0,0,0,0,1,0,0,0},{0,0,0,1,0,0,-1,-2,-4},{0,0,0,0,-2,-4,-6,-12,-16},{0,1,0,2,-4,-2,-2,-16,-12},{0,0,-2,-4,-12,-16,-18,-46,-48},{1,0,-4,-2,-16,-12,-10,-48,-36},{0,-1,-6,-2,-18,-10,-6,-46,-28},{0,-2,-12,-16,-46,-48,-46,-144,-128},{0,-4,-16,-12,-48,-36,-28,-128,-92}},{{0,0,0,0,0,0,1,0,0},{0,0,0,0,0,0,-499122176,499122176,-249561089},{0,0,0,0,499122176,-249561089,499122176,-3,499122173},{0,0,0,-249561087,-249561089,-499122176,1,499122173,-249561090},{0,0,499122176,-249561089,-3,499122173,249561085,499122165,249561077},{0,0,-249561089,-499122176,499122173,-249561090,-249561089,249561077,499122169},{1,-499122176,499122176,1,249561085,-249561089,249561089,-10,-5},{0,499122176,-3,499122173,499122165,249561077,-10,-36,-31},{0,-249561089,499122173,-249561090,249561077,499122169,-5,-31,249561067}},{{0,0,0,0,0,0,0,1,0},{0,0,0,0,1,0,499122175,-499122174,249561087},{0,0,1,0,-499122174,249561087,499122172,2,499122170},{0,0,0,249561090,249561087,499122176,-2,499122170,249561082},{0,1,-499122174,249561087,2,499122170,-249561100,499122168,-249561111},{0,0,249561087,499122176,499122170,249561082,249561081,-249561111,499122156},{0,499122175,499122172,-2,-249561100,249561081,-249561094,-29,-19},{1,-499122174,2,499122170,499122168,-249561111,-29,-51,-67},{0,249561087,499122170,249561082,-249561111,499122156,-19,-67,-249561143}},{{0,0,0,0,0,0,0,0,1},{0,0,0,0,0,1,2,2,5},{0,0,0,1,2,5,7,12,17},{0,0,1,-1,5,3,3,17,13},{0,0,2,5,12,17,19,46,49},{0,1,5,3,17,13,11,49,37},{0,2,7,3,19,11,7,47,29},{0,2,12,17,46,49,47,144,129},{1,5,17,13,49,37,29,129,93}} };
vm vecP = { 0,0,0,0,6,6,6,24,20 };
// --------------------------------------------------------------
// 木 DP
int n = sz(g);
vector<array<VTYPE, DIM>> dp(n);
rep(s, n) {
dp[s].fill(0);
dp[s][0] = 1;
}
auto apply = [&](const array<VTYPE, DIM>& x) {
array<VTYPE, DIM> z; z.fill(0);
rep(i, DIM) rep(j, DIM) z[i] += matA[i][j] * x[j];
return z;
};
auto merge = [&](const array<VTYPE, DIM>& x, const array<VTYPE, DIM>& y) {
array<VTYPE, DIM> z; z.fill(0);
rep(i, DIM) rep(j1, DIM) rep(j2, DIM) z[i] += tsrM[i][j1][j2] * x[j1] * y[j2];
return z;
};
function<void(int, int)> dfs = [&](int s, int p) {
bool first_call = true;
repe(t, g[s]) {
if (t == p) continue;
dfs(t, s);
if (first_call) {
dp[s] = dp[t];
first_call = false;
}
else {
dp[s] = merge(dp[s], dp[t]);
}
}
dp[s] = apply(dp[s]);
};
dfs(r, -1);
vector<VTYPE> res(n, 0);
rep(s, n) rep(j, DIM) res[s] += vecP[j] * dp[s][j];
return res;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
//【方法】
// 愚直を書いて集めたデータをもとに遷移テンソルを復元する．
//【使い方】
// 1. mint naive(親の列) を実装する．
// 2. embed_coefs(); を実行する．
// 3. 出力を solve() 内に貼る．
// 4. auto dp = solve<答えの型>(グラフ, 根) で勝手に DP してくれる．
// embed_coefs(INF, INF);
int n;
cin >> n;
auto g = read_Graph(n);
dump("naive:", naive(inputform(g, 0))); dump("======");
auto dp = solve<mint>(g, 0);
cout << dp[0].val() << "\n"; // ちょっとTLEが怖い
}
/*
----------- lv: 1 --------------
LT: 0 LB: 1
piv( 0 ):
----------- lv: 2 --------------
LT: 1 LB: 2
piv( 0 ):
----------- lv: 3 --------------
LT: 3 LB: 4
piv( 1 ):
(1,2)
----------- lv: 4 --------------
LT: 9 LB: 8
piv( 5 ):
(0,4) (1,2) (2,5) (3,1) (4,3)
----------- lv: 5 --------------
LT: 25 LB: 17
piv( 9 ):
(0,4) (1,2) (2,5) (3,1) (4,3) (6,8) (9,0) (10,6) (13,9)
----------- lv: 6 --------------
LT: 70 LB: 37
piv( 9 ):
(0,4) (1,2) (2,5) (3,1) (4,3) (6,8) (9,0) (10,6) (13,9)
constexpr int DIM = 9;
VTYPE matA[DIM][DIM] = {{0,0,0,0,0,0,0,0,0},{1,0,0,0,0,0,0,0,0},{0,0,0,-499122176,-4,-499122176,499122174,-11,499122173},{0,1,0,499122176,499122176,499122175,499122176,499122175,-2},{0,0,0,499122176,-499122169,499122176,-499122171,-499122156,7},{0,0,0,1,-3,1,-2,-8,-2},{0,0,1,-499122176,-499122175,-499122175,-499122176,-499122174,2},{0,0,0,0,499122173,0,-3,499122167,499122173},{0,0,0,0,3,0,3,8,3}};
VTYPE tsrM[DIM][DIM][DIM] = {{{1,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}},{{0,1,0,0,0,0,0,0,0},{1,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}},{{0,0,1,0,0,0,0,0,0},{0,1,0,0,0,0,-1,1,499122176},{1,0,0,0,1,499122176,-3,2,-3},{0,0,0,-499122174,499122176,1,-1,-3,499122174},{0,0,1,499122176,2,-3,499122169,-1,499122165},{0,0,499122176,1,-3,499122174,499122172,499122165,-11},{0,-1,-3,-1,499122169,499122172,499122172,-18,-12},{0,1,2,-3,-1,499122165,-18,-20,-36},{0,499122176,-3,499122174,499122165,-11,-12,-36,499122145}},{{0,0,0,1,0,0,0,0,0},{0,0,0,0,0,0,499122176,-499122176,249561089},{0,0,0,0,-499122176,249561089,-499122176,3,-499122173},{1,0,0,249561087,249561089,499122176,-1,-499122173,249561090},{0,0,-499122176,249561089,3,-499122173,-249561085,-499122165,-249561077},{0,0,249561089,499122176,-499122173,249561090,249561089,-249561077,-499122169},{0,499122176,-499122176,-1,-249561085,249561089,-249561089,10,5},{0,-499122176,3,-499122173,-499122165,-249561077,10,36,31},{0,249561089,-499122173,249561090,-249561077,-499122169,5,31,-249561067}},{{0,0,0,0,1,0,0,0,0},{0,0,1,0,0,0,-499122174,499122174,249561090},{0,1,0,0,499122174,249561090,-499122169,-3,-499122167},{0,0,0,249561084,249561090,499122176,3,-499122167,249561097},{1,0,499122174,249561090,-3,-499122167,-249561069,-499122166,-249561054},{0,0,249561090,499122176,-499122167,249561097,249561100,-249561054,-499122145},{0,-499122174,-499122169,3,-249561069,249561100,-249561078,47,31},{0,499122174,-3,-499122167,-499122166,-249561054,47,72,103},{0,249561090,-499122167,249561097,-249561054,-499122145,31,103,-249561002}},{{0,0,0,0,0,1,0,0,0},{0,0,0,1,0,0,-1,-2,-4},{0,0,0,0,-2,-4,-6,-12,-16},{0,1,0,2,-4,-2,-2,-16,-12},{0,0,-2,-4,-12,-16,-18,-46,-48},{1,0,-4,-2,-16,-12,-10,-48,-36},{0,-1,-6,-2,-18,-10,-6,-46,-28},{0,-2,-12,-16,-46,-48,-46,-144,-128},{0,-4,-16,-12,-48,-36,-28,-128,-92}},{{0,0,0,0,0,0,1,0,0},{0,0,0,0,0,0,-499122176,499122176,-249561089},{0,0,0,0,499122176,-249561089,499122176,-3,499122173},{0,0,0,-249561087,-249561089,-499122176,1,499122173,-249561090},{0,0,499122176,-249561089,-3,499122173,249561085,499122165,249561077},{0,0,-249561089,-499122176,499122173,-249561090,-249561089,249561077,499122169},{1,-499122176,499122176,1,249561085,-249561089,249561089,-10,-5},{0,499122176,-3,499122173,499122165,249561077,-10,-36,-31},{0,-249561089,499122173,-249561090,249561077,499122169,-5,-31,249561067}},{{0,0,0,0,0,0,0,1,0},{0,0,0,0,1,0,499122175,-499122174,249561087},{0,0,1,0,-499122174,249561087,499122172,2,499122170},{0,0,0,249561090,249561087,499122176,-2,499122170,249561082},{0,1,-499122174,249561087,2,499122170,-249561100,499122168,-249561111},{0,0,249561087,499122176,499122170,249561082,249561081,-249561111,499122156},{0,499122175,499122172,-2,-249561100,249561081,-249561094,-29,-19},{1,-499122174,2,499122170,499122168,-249561111,-29,-51,-67},{0,249561087,499122170,249561082,-249561111,499122156,-19,-67,-249561143}},{{0,0,0,0,0,0,0,0,1},{0,0,0,0,0,1,2,2,5},{0,0,0,1,2,5,7,12,17},{0,0,1,-1,5,3,3,17,13},{0,0,2,5,12,17,19,46,49},{0,1,5,3,17,13,11,49,37},{0,2,7,3,19,11,7,47,29},{0,2,12,17,46,49,47,144,129},{1,5,17,13,49,37,29,129,93}}};
VTYPE vecP[DIM] = {0,0,0,0,6,6,6,24,20};
*/