#680251 (D) No.1614 Majority Painting on Tree

提出ソース

結果

問題	No.1614 Majority Painting on Tree
ユーザー	👑 hos.lyric
提出日時	2021-07-21 21:56:40
言語	D (dmd 2.107.1)
結果	AC
実行時間	1,605 ms / 5,000 ms
コード長	5,406 bytes
コンパイル時間	2,062 ms
コンパイル使用メモリ	152,736 KB
実行使用メモリ	25,112 KB
最終ジャッジ日時	2023-09-04 13:20:10
合計ジャッジ時間	30,668 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,067 ms 24,892 KB
testcase_01	AC	376 ms 24,928 KB
testcase_02	AC	516 ms 24,960 KB
testcase_03	AC	863 ms 24,964 KB
testcase_04	AC	1,139 ms 24,948 KB
testcase_05	AC	1,083 ms 24,960 KB
testcase_06	AC	1,605 ms 24,976 KB
testcase_07	AC	1,134 ms 25,096 KB
testcase_08	AC	594 ms 24,976 KB
testcase_09	AC	861 ms 24,964 KB
testcase_10	AC	279 ms 25,108 KB
testcase_11	AC	1,031 ms 24,932 KB
testcase_12	AC	1,141 ms 24,980 KB
testcase_13	AC	821 ms 25,076 KB
testcase_14	AC	1,587 ms 24,964 KB
testcase_15	AC	1,521 ms 24,912 KB
testcase_16	AC	409 ms 24,972 KB
testcase_17	AC	752 ms 24,980 KB
testcase_18	AC	514 ms 25,112 KB
testcase_19	AC	250 ms 24,872 KB
testcase_20	AC	1,132 ms 24,936 KB
testcase_21	AC	1,164 ms 24,932 KB
testcase_22	AC	1,254 ms 25,028 KB
testcase_23	AC	195 ms 25,108 KB
testcase_24	AC	1,139 ms 24,956 KB
testcase_25	AC	311 ms 24,988 KB
testcase_26	AC	720 ms 24,872 KB
testcase_27	AC	9 ms 6,600 KB
testcase_28	AC	9 ms 6,480 KB
testcase_29	AC	9 ms 6,496 KB
testcase_30	AC	9 ms 6,328 KB
testcase_31	AC	9 ms 5,700 KB
testcase_32	AC	8 ms 6,492 KB
testcase_33	AC	9 ms 6,276 KB
testcase_34	AC	9 ms 5,724 KB
testcase_35	AC	9 ms 5,672 KB
testcase_36	AC	7 ms 5,640 KB
testcase_37	AC	7 ms 5,664 KB
testcase_38	AC	8 ms 5,764 KB
testcase_39	AC	8 ms 5,600 KB
testcase_40	AC	8 ms 5,664 KB
testcase_41	AC	8 ms 5,680 KB
testcase_42	AC	7 ms 6,496 KB
testcase_43	AC	7 ms 6,468 KB
testcase_44	AC	8 ms 6,628 KB
testcase_45	AC	8 ms 7,368 KB
testcase_46	AC	8 ms 7,040 KB
testcase_47	AC	7 ms 6,692 KB
testcase_48	AC	7 ms 6,668 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; }
real readReal() { return readToken.to!real; }

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 = 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;

enum LIM = 2 * 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -((Mint.M / i) * inv[cast(size_t)(Mint.M % i)]);
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (n < 0) {
    if (k >= 0) {
      return (-1)^^(k & 1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (-1)^^((n - k) & 1) * binom(-k - 1, n - k);
    } else {
      return Mint(0);
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM);
      return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
    } else {
      return Mint(0);
    }
  }
}


int N, C;
int[] A, B;

void main() {
  prepare;
  
  try {
    for (; ; ) {
      N = readInt();
      C = readInt();
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      auto deg = new int[N];
      foreach (i; 0 .. N - 1) {
        ++deg[A[i]];
        ++deg[B[i]];
      }
      int r;
      foreach (u; 0 .. N) {
        if (deg[u] == 1) {
          r = u;
          break;
        }
      }
      debug {
        writeln("deg = ", deg);
        writeln("r = ", r);
      }
      
      auto fs = new Mint[C + 1];
      foreach (c; 1 .. C + 1) {
        auto pw0 = new Mint[N + 1];
        auto pw1 = new Mint[N + 1];
        pw0[0] = pw1[0] = 1;
        foreach (i; 1 .. N + 1) {
          pw0[i] = pw0[i - 1] * c;
          pw1[i] = pw1[i - 1] * (c - 1);
        }
        fs[c] = c;
        foreach (u; 0 .. N) {
          if (u != r) {
            Mint num = pw0[deg[u]];
            foreach (k; 0 .. deg[u] + 1) {
              if (2 * k > deg[u]) {
                num -= binom(deg[u], k) * c * pw1[deg[u] - k];
              }
            }
            num += c;
            num *= inv[c];
            fs[c] *= num;
          }
        }
      }
      debug {
        writeln("fs = ", fs);
      }
      
      Mint ans;
      foreach (c; 0 .. C + 1) {
        ans += binom(C, c) * (-1)^^(c & 1) * fs[C - c];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード