結果

問題 No.2584 The University of Tree
ユーザー 👑 emthrmemthrm
提出日時 2023-12-12 01:10:45
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 377 ms / 3,000 ms
コード長 7,114 bytes
コンパイル時間 3,597 ms
コンパイル使用メモリ 262,276 KB
実行使用メモリ 68,240 KB
最終ジャッジ日時 2023-12-12 01:11:00
合計ジャッジ時間 14,319 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 1 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 2 ms
6,676 KB
testcase_08 AC 2 ms
6,676 KB
testcase_09 AC 2 ms
6,676 KB
testcase_10 AC 2 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 2 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 176 ms
35,828 KB
testcase_23 AC 161 ms
19,712 KB
testcase_24 AC 98 ms
12,544 KB
testcase_25 AC 114 ms
14,208 KB
testcase_26 AC 72 ms
12,928 KB
testcase_27 AC 148 ms
22,480 KB
testcase_28 AC 83 ms
16,896 KB
testcase_29 AC 41 ms
9,856 KB
testcase_30 AC 327 ms
35,840 KB
testcase_31 AC 345 ms
49,752 KB
testcase_32 AC 71 ms
17,792 KB
testcase_33 AC 206 ms
67,024 KB
testcase_34 AC 47 ms
9,600 KB
testcase_35 AC 373 ms
48,784 KB
testcase_36 AC 273 ms
29,872 KB
testcase_37 AC 287 ms
27,536 KB
testcase_38 AC 288 ms
27,536 KB
testcase_39 AC 289 ms
35,672 KB
testcase_40 AC 309 ms
48,928 KB
testcase_41 AC 349 ms
43,368 KB
testcase_42 AC 333 ms
45,200 KB
testcase_43 AC 318 ms
40,080 KB
testcase_44 AC 377 ms
56,720 KB
testcase_45 AC 354 ms
56,720 KB
testcase_46 AC 211 ms
68,240 KB
testcase_47 AC 221 ms
29,872 KB
testcase_48 AC 103 ms
12,928 KB
testcase_49 AC 260 ms
25,484 KB
testcase_50 AC 210 ms
21,724 KB
testcase_51 AC 114 ms
14,080 KB
testcase_52 AC 46 ms
8,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <unsigned int M>
struct MInt {
  unsigned int v;

  constexpr MInt() : v(0) {}
  constexpr MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
  static constexpr MInt raw(const int x) {
    MInt x_;
    x_.v = x;
    return x_;
  }

  static constexpr int get_mod() { return M; }
  static constexpr void set_mod(const int divisor) {
    assert(std::cmp_equal(divisor, M));
  }

  static void init(const int x) {
    inv<true>(x);
    fact(x);
    fact_inv(x);
  }

  template <bool MEMOIZES = false>
  static MInt inv(const int n) {
    // assert(0 <= n && n < M && std::gcd(n, M) == 1);
    static std::vector<MInt> inverse{0, 1};
    const int prev = inverse.size();
    if (n < prev) return inverse[n];
    if constexpr (MEMOIZES) {
      // "n!" and "M" must be disjoint.
      inverse.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        inverse[i] = -inverse[M % i] * raw(M / i);
      }
      return inverse[n];
    }
    int u = 1, v = 0;
    for (unsigned int a = n, b = M; b;) {
      const unsigned int q = a / b;
      std::swap(a -= q * b, b);
      std::swap(u -= q * v, v);
    }
    return u;
  }

  static MInt fact(const int n) {
    static std::vector<MInt> factorial{1};
    if (const int prev = factorial.size(); n >= prev) {
      factorial.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        factorial[i] = factorial[i - 1] * i;
      }
    }
    return factorial[n];
  }

  static MInt fact_inv(const int n) {
    static std::vector<MInt> f_inv{1};
    if (const int prev = f_inv.size(); n >= prev) {
      f_inv.resize(n + 1);
      f_inv[n] = inv(fact(n).v);
      for (int i = n; i > prev; --i) {
        f_inv[i - 1] = f_inv[i] * i;
      }
    }
    return f_inv[n];
  }

  static MInt nCk(const int n, const int k) {
    if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
    return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
                                  fact_inv(n - k) * fact_inv(k));
  }
  static MInt nPk(const int n, const int k) {
    return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k);
  }
  static MInt nHk(const int n, const int k) {
    return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k));
  }

  static MInt large_nCk(long long n, const int k) {
    if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
    inv<true>(k);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) {
      res *= inv(i) * n--;
    }
    return res;
  }

  constexpr MInt pow(long long exponent) const {
    MInt res = 1, tmp = *this;
    for (; exponent > 0; exponent >>= 1) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
    }
    return res;
  }

  constexpr MInt& operator+=(const MInt& x) {
    if ((v += x.v) >= M) v -= M;
    return *this;
  }
  constexpr MInt& operator-=(const MInt& x) {
    if ((v += M - x.v) >= M) v -= M;
    return *this;
  }
  constexpr MInt& operator*=(const MInt& x) {
    v = (unsigned long long){v} * x.v % M;
    return *this;
  }
  MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }

  constexpr auto operator<=>(const MInt& x) const = default;

  constexpr MInt& operator++() {
    if (++v == M) [[unlikely]] v = 0;
    return *this;
  }
  constexpr MInt operator++(int) {
    const MInt res = *this;
    ++*this;
    return res;
  }
  constexpr MInt& operator--() {
    v = (v == 0 ? M - 1 : v - 1);
    return *this;
  }
  constexpr MInt operator--(int) {
    const MInt res = *this;
    --*this;
    return res;
  }

  constexpr MInt operator+() const { return *this; }
  constexpr MInt operator-() const { return raw(v ? M - v : 0); }

  constexpr MInt operator+(const MInt& x) const { return MInt(*this) += x; }
  constexpr MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
  constexpr MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt& x) const { return MInt(*this) /= x; }

  friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
    return os << x.v;
  }
  friend std::istream& operator>>(std::istream& is, MInt& x) {
    long long v;
    is >> v;
    x = MInt(v);
    return is;
  }
};
using ModInt = MInt<MOD>;

int main() {
  int n; cin >> n;
  vector<vector<int>> e(n);
  vector<int> u(n - 1, -1), v(n - 1, -1);
  REP(i, n) {
    int c; cin >> c;
    e[i].resize(c);
    for (int& e_ij : e[i]) {
      cin >> e_ij; --e_ij;
      (u[e_ij] == -1 ? u : v)[e_ij] = i;
    }
  }
  REP(i, n) {
    for (int& e_ij : e[i]) e_ij = (u[e_ij] == i ? v : u)[e_ij];
  }
  vector<vector<ModInt>> children(n);
  const auto dfs1 = [&](auto dfs1, const int par, const int ver) -> ModInt {
    const int c = e[ver].size();
    children[ver].assign(c, 0);
    ModInt cur = 1, res = 0;
    for (int i = c - 1; i >= 0; --i) {
      cur *= ver + 1;
      if (e[ver][i] == par) {
        res = cur;
      } else {
        children[ver][i] = dfs1(dfs1, ver, e[ver][i]);
      }
    }
    if (par != -1) {
      const int x = distance(e[ver].begin(), ranges::find(e[ver], par));
      cur = 1;
      for (int i = (x + 1) % c; i != x; i = (i + 1) % c) {
        if (i == 0) cur *= ver + 1;
        cur *= ver + 1;
        res += cur * children[ver][i];
      }
    }
    return res;
  };
  dfs1(dfs1, -1, 0);
  // REP(i, n) {
  //   cout << i << ':';
  //   for (const ModInt& c : children[i]) cout << ' ' << c;
  //   cout << '\n';
  // }
  vector<ModInt> ans(n, 0);
  const auto dfs2 = [&](auto dfs2, const int par, const int ver, const ModInt& par_dp) -> void {
    if (par != -1) children[ver][distance(e[ver].begin(), ranges::find(e[ver], par))] = par_dp;
    for (ModInt cur = 1; const ModInt& child : children[ver]) {
      cur *= ver + 1;
      ans[ver] += cur * child;
    }
    const int c = e[ver].size();
    vector<ModInt> chi_dp(c, 0);
    ModInt cur = 1;
    for (int i = c - 1; i >= 0; --i) {
      cur *= ver + 1;
      chi_dp[i] = cur;
      cur += children[ver][i];
    }
    const ModInt tmp = ModInt::raw(ver + 1).pow(c + 1);
    cur = 0;
    REP(i, c) {
      cur /= ver + 1;
      chi_dp[i] += cur;
      cur += children[ver][i] * tmp;
    }
    REP(i, c) {
      if (e[ver][i] != par) dfs2(dfs2, ver, e[ver][i], chi_dp[i]);
    }
  };
  dfs2(dfs2, -1, 0, 0);
  for (const ModInt& ans_i : ans) cout << ans_i << '\n';
  return 0;
}
0