結果
| 問題 | No.2584 The University of Tree |
| ユーザー |
👑  hitonanode
|
| 提出日時 | 2023-12-12 00:50:52 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 418 ms / 3,000 ms |
| コード長 | 20,319 bytes |
| コンパイル時間 | 2,702 ms |
| コンパイル使用メモリ | 202,312 KB |
| 実行使用メモリ | 68,100 KB |
| 最終ジャッジ日時 | 2023-12-12 00:51:08 |
| 合計ジャッジ時間 | 14,459 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,676 KB |
| testcase_01 | AC | 2 ms
6,676 KB |
| testcase_02 | AC | 2 ms
6,676 KB |
| testcase_03 | AC | 2 ms
6,676 KB |
| testcase_04 | AC | 2 ms
6,676 KB |
| testcase_05 | AC | 2 ms
6,676 KB |
| testcase_06 | AC | 2 ms
6,676 KB |
| testcase_07 | AC | 3 ms
6,676 KB |
| testcase_08 | AC | 2 ms
6,676 KB |
| testcase_09 | AC | 2 ms
6,676 KB |
| testcase_10 | AC | 3 ms
6,676 KB |
| testcase_11 | AC | 2 ms
6,676 KB |
| testcase_12 | AC | 2 ms
6,676 KB |
| testcase_13 | AC | 2 ms
6,676 KB |
| testcase_14 | AC | 3 ms
6,676 KB |
| testcase_15 | AC | 2 ms
6,676 KB |
| testcase_16 | AC | 2 ms
6,676 KB |
| testcase_17 | AC | 2 ms
6,676 KB |
| testcase_18 | AC | 2 ms
6,676 KB |
| testcase_19 | AC | 2 ms
6,676 KB |
| testcase_20 | AC | 2 ms
6,676 KB |
| testcase_21 | AC | 2 ms
6,676 KB |
| testcase_22 | AC | 190 ms
35,468 KB |
| testcase_23 | AC | 173 ms
18,024 KB |
| testcase_24 | AC | 111 ms
11,892 KB |
| testcase_25 | AC | 117 ms
12,884 KB |
| testcase_26 | AC | 76 ms
12,268 KB |
| testcase_27 | AC | 160 ms
21,348 KB |
| testcase_28 | AC | 86 ms
16,512 KB |
| testcase_29 | AC | 41 ms
9,472 KB |
| testcase_30 | AC | 378 ms
32,820 KB |
| testcase_31 | AC | 399 ms
48,316 KB |
| testcase_32 | AC | 80 ms
17,920 KB |
| testcase_33 | AC | 170 ms
66,932 KB |
| testcase_34 | AC | 50 ms
9,148 KB |
| testcase_35 | AC | 395 ms
47,112 KB |
| testcase_36 | AC | 292 ms
27,572 KB |
| testcase_37 | AC | 345 ms
24,352 KB |
| testcase_38 | AC | 303 ms
24,352 KB |
| testcase_39 | AC | 325 ms
33,576 KB |
| testcase_40 | AC | 384 ms
47,532 KB |
| testcase_41 | AC | 371 ms
41,128 KB |
| testcase_42 | AC | 375 ms
42,912 KB |
| testcase_43 | AC | 382 ms
37,408 KB |
| testcase_44 | AC | 416 ms
55,776 KB |
| testcase_45 | AC | 418 ms
55,268 KB |
| testcase_46 | AC | 172 ms
68,100 KB |
| testcase_47 | AC | 273 ms
27,572 KB |
| testcase_48 | AC | 99 ms
12,048 KB |
| testcase_49 | AC | 280 ms
22,680 KB |
| testcase_50 | AC | 246 ms
20,040 KB |
| testcase_51 | AC | 114 ms
12,788 KB |
| testcase_52 | AC | 43 ms
7,936 KB |
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif
template <int md> struct ModInt {
using lint = long long;
constexpr static int mod() { return md; }
static int get_primitive_root() {
static int primitive_root = 0;
if (!primitive_root) {
primitive_root = [&]() {
std::set<int> fac;
int v = md - 1;
for (lint 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 < md; g++) {
bool ok = true;
for (auto i : fac)
if (ModInt(g).pow((md - 1) / i) == 1) {
ok = false;
break;
}
if (ok) return g;
}
return -1;
}();
}
return primitive_root;
}
int val_;
int val() const noexcept { return val_; }
constexpr ModInt() : val_(0) {}
constexpr ModInt &_setval(lint v) { return val_ = (v >= md ? v - md : v), *this; }
constexpr ModInt(lint v) { _setval(v % md + md); }
constexpr explicit operator bool() const { return val_ != 0; }
constexpr ModInt operator+(const ModInt &x) const {
return ModInt()._setval((lint)val_ + x.val_);
}
constexpr ModInt operator-(const ModInt &x) const {
return ModInt()._setval((lint)val_ - x.val_ + md);
}
constexpr ModInt operator*(const ModInt &x) const {
return ModInt()._setval((lint)val_ * x.val_ % md);
}
constexpr ModInt operator/(const ModInt &x) const {
return ModInt()._setval((lint)val_ * x.inv().val() % md);
}
constexpr ModInt operator-() const { return ModInt()._setval(md - val_); }
constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }
constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }
constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }
constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }
friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt(a) + x; }
friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt(a) - x; }
friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt(a) * x; }
friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt(a) / x; }
constexpr bool operator==(const ModInt &x) const { return val_ == x.val_; }
constexpr bool operator!=(const ModInt &x) const { return val_ != x.val_; }
constexpr bool operator<(const ModInt &x) const {
return val_ < x.val_;
} // To use std::map<ModInt, T>
friend std::istream &operator>>(std::istream &is, ModInt &x) {
lint t;
return is >> t, x = ModInt(t), is;
}
constexpr friend std::ostream &operator<<(std::ostream &os, const ModInt &x) {
return os << x.val_;
}
constexpr ModInt pow(lint n) const {
ModInt ans = 1, tmp = *this;
while (n) {
if (n & 1) ans *= tmp;
tmp *= tmp, n >>= 1;
}
return ans;
}
static constexpr int cache_limit = std::min(md, 1 << 21);
static std::vector<ModInt> facs, facinvs, invs;
constexpr static void _precalculation(int N) {
const int l0 = facs.size();
if (N > md) N = md;
if (N <= l0) return;
facs.resize(N), facinvs.resize(N), invs.resize(N);
for (int i = l0; i < N; i++) facs[i] = facs[i - 1] * i;
facinvs[N - 1] = facs.back().pow(md - 2);
for (int i = N - 2; i >= l0; i--) facinvs[i] = facinvs[i + 1] * (i + 1);
for (int i = N - 1; i >= l0; i--) invs[i] = facinvs[i] * facs[i - 1];
}
constexpr ModInt inv() const {
if (this->val_ < cache_limit) {
if (facs.empty()) facs = {1}, facinvs = {1}, invs = {0};
while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);
return invs[this->val_];
} else {
return this->pow(md - 2);
}
}
constexpr ModInt fac() const {
while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);
return facs[this->val_];
}
constexpr ModInt facinv() const {
while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);
return facinvs[this->val_];
}
constexpr ModInt doublefac() const {
lint k = (this->val_ + 1) / 2;
return (this->val_ & 1) ? ModInt(k * 2).fac() / (ModInt(2).pow(k) * ModInt(k).fac())
: ModInt(k).fac() * ModInt(2).pow(k);
}
constexpr ModInt nCr(int r) const {
if (r < 0 or this->val_ < r) return ModInt(0);
return this->fac() * (*this - r).facinv() * ModInt(r).facinv();
}
constexpr ModInt nPr(int r) const {
if (r < 0 or this->val_ < r) return ModInt(0);
return this->fac() * (*this - r).facinv();
}
static ModInt binom(int n, int r) {
static long long bruteforce_times = 0;
if (r < 0 or n < r) return ModInt(0);
if (n <= bruteforce_times or n < (int)facs.size()) return ModInt(n).nCr(r);
r = std::min(r, n - r);
ModInt ret = ModInt(r).facinv();
for (int i = 0; i < r; ++i) ret *= n - i;
bruteforce_times += r;
return ret;
}
// Multinomial coefficient, (k_1 + k_2 + ... + k_m)! / (k_1! k_2! ... k_m!)
// Complexity: O(sum(ks))
template <class Vec> static ModInt multinomial(const Vec &ks) {
ModInt ret{1};
int sum = 0;
for (int k : ks) {
assert(k >= 0);
ret *= ModInt(k).facinv(), sum += k;
}
return ret * ModInt(sum).fac();
}
// Catalan number, C_n = binom(2n, n) / (n + 1)
// C_0 = 1, C_1 = 1, C_2 = 2, C_3 = 5, C_4 = 14, ...
// https://oeis.org/A000108
// Complexity: O(n)
static ModInt catalan(int n) {
if (n < 0) return ModInt(0);
return ModInt(n * 2).fac() * ModInt(n + 1).facinv() * ModInt(n).facinv();
}
ModInt sqrt() const {
if (val_ == 0) return 0;
if (md == 2) return val_;
if (pow((md - 1) / 2) != 1) return 0;
ModInt b = 1;
while (b.pow((md - 1) / 2) == 1) b += 1;
int e = 0, m = md - 1;
while (m % 2 == 0) m >>= 1, e++;
ModInt x = pow((m - 1) / 2), y = (*this) * x * x;
x *= (*this);
ModInt z = b.pow(m);
while (y != 1) {
int j = 0;
ModInt t = y;
while (t != 1) j++, t *= t;
z = z.pow(1LL << (e - j - 1));
x *= z, z *= z, y *= z;
e = j;
}
return ModInt(std::min(x.val_, md - x.val_));
}
};
template <int md> std::vector<ModInt<md>> ModInt<md>::facs = {1};
template <int md> std::vector<ModInt<md>> ModInt<md>::facinvs = {1};
template <int md> std::vector<ModInt<md>> ModInt<md>::invs = {0};
using mint = ModInt<998244353>;
// Rerooting
// Reference:
// - https://atcoder.jp/contests/abc222/editorial/2749
// - https://null-mn.hatenablog.com/entry/2020/04/14/124151
template <class Edge, class St, class Ch, Ch (*merge)(Ch, Ch), Ch (*f)(St, int, Edge),
St (*g)(Ch, int), Ch (*e)()>
struct rerooting {
int n_;
std::vector<int> par, visited;
std::vector<std::vector<std::pair<int, Edge>>> to;
std::vector<St> dp_subtree;
std::vector<St> dp_par;
std::vector<St> dpall;
rerooting(const std::vector<std::vector<std::pair<int, Edge>>> &to_)
: n_(to_.size()), par(n_, -1), visited(n_, 0), to(to_) {
for (int i = 0; i < n_; ++i) dp_subtree.push_back(g(e(), i));
dp_par = dpall = dp_subtree;
}
void run_connected(int root) {
if (visited[root]) return;
visited[root] = 1;
std::vector<int> visorder{root};
for (int t = 0; t < int(visorder.size()); ++t) {
int now = visorder[t];
for (const auto &edge : to[now]) {
int nxt = edge.first;
if (visited[nxt]) continue;
visorder.push_back(nxt);
visited[nxt] = 1;
par[nxt] = now;
}
}
for (int t = int(visorder.size()) - 1; t >= 0; --t) {
int now = visorder[t];
Ch ch = e();
for (const auto &edge : to[now]) {
int nxt = edge.first;
if (nxt == par[now]) continue;
ch = merge(ch, f(dp_subtree[nxt], nxt, edge.second));
}
dp_subtree[now] = g(ch, now);
}
std::vector<Ch> left;
for (int now : visorder) {
int m = int(to[now].size());
left.assign(m + 1, e());
for (int j = 0; j < m; j++) {
int nxt = to[now][j].first;
const St &st = (nxt == par[now] ? dp_par[now] : dp_subtree[nxt]);
left[j + 1] = merge(left[j], f(st, nxt, to[now][j].second));
}
dpall[now] = g(left.back(), now);
Ch rprod = e();
for (int j = m - 1; j >= 0; --j) {
int nxt = to[now][j].first;
if (nxt != par[now]) dp_par[nxt] = g(merge(left[j], rprod), now);
const St &st = (nxt == par[now] ? dp_par[now] : dp_subtree[nxt]);
rprod = merge(f(st, nxt, to[now][j].second), rprod);
}
}
}
void run() {
for (int i = 0; i < n_; ++i) {
if (!visited[i]) run_connected(i);
}
}
const St &get_subtree(int root_, int par_) const {
if (par_ < 0) return dpall.at(root_);
if (par.at(root_) == par_) return dp_subtree.at(root_);
if (par.at(par_) == root_) return dp_par.at(par_);
std::exit(1);
}
};
/* Template:
struct Subtree {};
struct Child {};
struct Edge {};
Child e() { return Child(); }
Child merge(Child x, Child y) { return Child(); }
Child f(Subtree x, int ch_id, Edge edge) { return Child(); }
Subtree g(Child x, int v_id) { return Subtree(); }
vector<vector<pair<int, Edge>>> to;
rerooting<Edge, Subtree, Child, merge, f, g, e> tree(to);
*/
int main() {
int N;
cin >> N;
vector<vector<int>> to_edges(N);
REP(i, N) {
int C;
cin >> C;
REP(t, C) {
int e;
cin >> e;
--e;
to_edges.at(i).push_back(e);
}
}
dbg(to_edges);
vector<pair<pint, pint>> edges(N - 1, make_pair(make_pair(-1, -1), make_pair(-1, -1)));
REP(i, N) {
REP(pos, to_edges.at(i).size()) {
int eid = to_edges.at(i).at(pos);
if (edges.at(eid).first.first == -1) {
edges.at(eid).first = make_pair(i, pos);
} else {
edges.at(eid).second = make_pair(i, pos);
}
}
}
dbg(edges);
vector<mint> dpchild(N), dppar(N);
vector<mint> ret(N);
vector<int> curs(N, -1);
auto rec1 = [&](auto &&self, int now, int prvvid, int prveid) -> void {
if (prveid >= 0) {
int cur = 0;
while (to_edges.at(now).at(cur) != prveid) ++cur;
curs.at(now) = cur;
}
const int D = to_edges.at(now).size();
for (int eid : to_edges.at(now)) {
if (eid == prveid) continue;
int nxt = edges.at(eid).first.first;
if (nxt == now) nxt = edges.at(eid).second.first;
self(self, nxt, now, eid);
}
vector<mint> tmp;
tmp.reserve((1 + D) * 2);
tmp.push_back(1);
for (int eid : to_edges.at(now)) {
int nxt = edges.at(eid).first.first;
if (nxt == now) nxt = edges.at(eid).second.first;
tmp.push_back(dpchild.at(nxt));
}
REP(i, 1 + D) tmp.push_back(tmp.at(i));
assert((int)tmp.size() == (1 + D) * 2);
vector<mint> tmp_cs(tmp.size() + 1);
const mint w = mint(now + 1).inv();
const mint winvpow = mint(now + 1).pow(D);
{
REP(i, tmp.size()) {
tmp_cs.at(i + 1) = tmp_cs.at(i) * w + tmp.at(i);
}
}
dbg(make_tuple(now, tmp, tmp_cs));
auto get_sum = [&](int l, int r) -> mint {
assert(r - l == D);
auto ans = tmp_cs.at(r) * winvpow - tmp_cs.at(l);
dbg(make_tuple(now, l, r, ans));
return ans;
};
ret.at(now) += get_sum(1, D + 1);
// dpchild.at(now) += 1;
if (curs.at(now) >= 0) dpchild.at(now) += get_sum(1 + curs.at(now) + 1, 1 + curs.at(now) + D + 1);
REP(d, D) {
int nxt = edges.at(to_edges.at(now).at(d)).first.first;
if (nxt == now) nxt = edges.at(to_edges.at(now).at(d)).second.first;
if (nxt == prvvid) continue;
dppar.at(nxt) += get_sum(1 + d + 1, 1 + d + 1 + D);
}
};
rec1(rec1, 0, -1, -1);
auto rec2 = [&](auto &&self, int now, int prveid) -> void {
const int D = to_edges.at(now).size();
ret.at(now) += dppar.at(now) * mint(now + 1).pow(1 + curs.at(now));
REP(d, D) {
const int eid = to_edges.at(now).at(d);
if (eid == prveid) continue;
int nxt = edges.at(eid).first.first;
if (nxt == now) nxt = edges.at(eid).second.first;
if (prveid >= 0) {
dppar.at(nxt) += dppar.at(now) * mint(now + 1).pow((curs.at(now) + (D + 1) - d) % (D + 1));
}
self(self, nxt, eid);
}
};
rec2(rec2, 0, -1);
dbg(dpchild);
dbg(dppar);
dbg(ret);
for (auto x : ret) cout << x << '\n';
}