結果

問題 No.1392 Don't be together
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-02-12 21:29:54
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 301 ms / 2,000 ms
コード長 4,987 bytes
コンパイル時間 2,048 ms
コンパイル使用メモリ 155,656 KB
実行使用メモリ 132,620 KB
最終ジャッジ日時 2024-06-22 10:50:47
合計ジャッジ時間 9,699 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 192 ms
103,408 KB
testcase_01 AC 205 ms
103,452 KB
testcase_02 AC 186 ms
103,476 KB
testcase_03 AC 188 ms
103,484 KB
testcase_04 AC 188 ms
103,464 KB
testcase_05 AC 190 ms
103,424 KB
testcase_06 AC 294 ms
132,620 KB
testcase_07 AC 187 ms
103,732 KB
testcase_08 AC 293 ms
108,996 KB
testcase_09 AC 301 ms
122,996 KB
testcase_10 AC 263 ms
103,720 KB
testcase_11 AC 287 ms
103,820 KB
testcase_12 AC 276 ms
103,752 KB
testcase_13 AC 277 ms
103,732 KB
testcase_14 AC 249 ms
103,612 KB
testcase_15 AC 216 ms
103,688 KB
testcase_16 AC 299 ms
103,808 KB
testcase_17 AC 254 ms
103,720 KB
testcase_18 AC 280 ms
103,764 KB
testcase_19 AC 251 ms
103,724 KB
testcase_20 AC 197 ms
103,616 KB
testcase_21 AC 194 ms
103,540 KB
testcase_22 AC 239 ms
103,828 KB
testcase_23 AC 217 ms
103,648 KB
testcase_24 AC 192 ms
103,488 KB
testcase_25 AC 231 ms
103,672 KB
testcase_26 AC 194 ms
103,568 KB
testcase_27 AC 231 ms
103,648 KB
testcase_28 AC 228 ms
103,636 KB
testcase_29 AC 209 ms
103,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

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


enum LIM = 5010;
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 (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 root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

void main() {
  prepare;
  
  auto S = new Mint[][](LIM, LIM);
  foreach (n; 0 .. LIM) {
    S[n][0] = 0;
    S[n][n] = 1;
    foreach (k; 1 .. n) {
      S[n][k] = S[n - 1][k - 1] + k * S[n - 1][k];
    }
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto P = new int[N];
      foreach (u; 0 .. N) {
        P[u] = readInt() - 1;
      }
      
      auto uf = new int[N];
      uf[] = -1;
      foreach (u; 0 .. N) {
        uf.connect(u, P[u]);
      }
      
      auto crt = [Mint(1)];
      foreach (r; 0 .. N) {
        if (uf[r] < 0) {
          const sz = -uf[r];
          auto here = new Mint[sz + 1];
          foreach (j; 0 .. sz) {
            here[sz - j] += (-1)^^(j & 1) * binom(sz, j);
          }
          here[1] += (-1)^^(sz & 1);
          auto nxt = new Mint[crt.length + sz];
          foreach (i; 0 .. cast(int)(crt.length)) {
            foreach (j; 0 .. sz + 1) {
              nxt[i + j] += crt[i] * here[j];
            }
          }
          crt = nxt;
        }
      }
      debug {
        writeln("crt = ", crt);
      }
      
      Mint ans;
      foreach (i; 0 .. N + 1) {
        ans += crt[i] * S[i][M];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0