#937966 (D) No.2584 The University of Tree

提出ソース

結果

問題	No.2584 The University of Tree
ユーザー	👑 hos.lyric
提出日時	2023-12-12 00:26:30
言語	D (dmd 2.106.1)
結果	AC
実行時間	854 ms / 3,000 ms
コード長	5,588 bytes
コンパイル時間	1,806 ms
コンパイル使用メモリ	142,464 KB
実行使用メモリ	94,588 KB
最終ジャッジ日時	2023-12-12 00:26:58
合計ジャッジ時間	22,606 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,676 KB
testcase_01	AC	1 ms 6,676 KB
testcase_02	AC	1 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	5 ms 6,676 KB
testcase_09	AC	2 ms 6,676 KB
testcase_10	AC	2 ms 6,676 KB
testcase_11	AC	1 ms 6,676 KB
testcase_12	AC	2 ms 6,676 KB
testcase_13	AC	1 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	1 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	427 ms 52,196 KB
testcase_23	AC	389 ms 35,556 KB
testcase_24	AC	271 ms 24,628 KB
testcase_25	AC	326 ms 24,316 KB
testcase_26	AC	193 ms 18,956 KB
testcase_27	AC	345 ms 35,864 KB
testcase_28	AC	205 ms 22,816 KB
testcase_29	AC	113 ms 16,968 KB
testcase_30	AC	803 ms 58,656 KB
testcase_31	AC	841 ms 75,544 KB
testcase_32	AC	154 ms 23,916 KB
testcase_33	AC	570 ms 94,076 KB
testcase_34	AC	126 ms 13,736 KB
testcase_35	AC	854 ms 73,736 KB
testcase_36	AC	712 ms 44,112 KB
testcase_37	AC	752 ms 52,436 KB
testcase_38	AC	730 ms 47,000 KB
testcase_39	AC	722 ms 51,300 KB
testcase_40	AC	764 ms 76,496 KB
testcase_41	AC	683 ms 68,028 KB
testcase_42	AC	766 ms 74,448 KB
testcase_43	AC	756 ms 61,796 KB
testcase_44	AC	753 ms 82,400 KB
testcase_45	AC	819 ms 82,360 KB
testcase_46	AC	569 ms 94,588 KB
testcase_47	AC	613 ms 51,960 KB
testcase_48	AC	266 ms 24,828 KB
testcase_49	AC	618 ms 50,740 KB
testcase_50	AC	511 ms 35,336 KB
testcase_51	AC	256 ms 26,644 KB
testcase_52	AC	112 ms 13,572 KB

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

ソースコード

raw source code

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = cast(uint)(x_ % M); }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


int N;
int[] C;
int[][] G;
int[][] E;

int[] par;
Mint[] dp, DP;

void dfs(int u, int p) {
  par[u] = p;
  if (~p) {
    foreach (c; 0 .. C[u]) if (E[u][c] == p) {
      E[u] = E[u][c .. $] ~ E[u][0 .. c];
      break;
    }
  }
  debug {
    writeln(u, " ", p, " ", E[u]);
  }
  foreach (c; 1 .. C[u]) if (~E[u][c]) {
    dfs(E[u][c], u);
  }
  auto ws = new Mint[C[u] + 1];
  ws[0] = 1;
  foreach (c; 1 .. C[u] + 1) ws[c] = ws[c - 1] * Mint(u + 1);
  dp[u] = 0;
  foreach (c; 1 .. C[u]) {
    dp[u] += ws[c] * ((~E[u][c]) ? dp[E[u][c]] : Mint(1));
  }
}

void DFS(int u, int p) {
  auto ws = new Mint[C[u] + 1];
  ws[0] = 1;
  foreach (c; 1 .. C[u] + 1) ws[c] = ws[c - 1] * Mint(u + 1);
  auto pre = new Mint[C[u] + 1];
  auto suf = new Mint[C[u] + 1];
  foreach (c; 0 .. C[u]) pre[c + 1] = pre[c] + ws[c] * ((~E[u][c]) ? (c ? dp[E[u][c]] : DP[u]) : Mint(1));
  foreach_reverse (c; 0 .. C[u]) suf[c] = ((~E[u][c]) ? (c ? dp[E[u][c]] : DP[u]) : Mint(1)) + ws[1] * suf[c + 1];
  foreach (c; 1 .. C[u]) if (~E[u][c]) {
    DP[E[u][c]] = ws[1] * suf[c + 1] + ws[C[u] - c] * pre[c];
  }
  foreach (c; 1 .. C[u]) if (~E[u][c]) {
    DFS(E[u][c], u);
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      C = new int[N];
      G = new int[][N];
      foreach (u; 0 .. N) {
        C[u] = readInt + 1;
        G[u] = new int[C[u]];
        foreach (c; 1 .. C[u]) {
          G[u][c] = readInt - 1;
        }
        G[u][0] = -1;
      }
      
      auto uss = new int[][N - 1];
      foreach (u; 0 .. N) foreach (c; 1 .. C[u]) {
        uss[G[u][c]] ~= u;
      }
      E = new int[][N];
      foreach (u; 0 .. N) {
        E[u] = new int[C[u]];
        E[u][0] = -1;
        foreach (c; 1 .. C[u]) {
          const i = G[u][c];
          E[u][c] = uss[i][0] ^ uss[i][1] ^ u;
        }
      }
      
      par.length = N;
      dp.length = N;
      DP.length = N;
      const rt = 0;
      dfs(rt, -1);
      DFS(rt, -1);
      debug {
        writeln("rt = ", rt);
        writeln("dp = ", dp);
        writeln("DP = ", DP);
      }
      foreach (u; 0 .. N) {
        int c0 = -1;
        foreach (c; 0 .. C[u]) if (!~E[u][c]) c0 = c;
        const Mint w = Mint(u + 1);
        Mint ans;
        void add(int c) {
          ans += (c ? dp[E[u][c]] : DP[u]);
          ans *= w;
        }
        foreach_reverse (c; 0 .. c0) add(c);
        foreach_reverse (c; c0 + 1 .. C[u]) add(c);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード