#811306 (D) No.1710 Minimum OR is X

提出ソース

結果

問題	No.1710 Minimum OR is X
ユーザー	👑 hos.lyric
提出日時	2022-10-27 21:15:13
言語	D (dmd 2.106.1)
結果	AC
実行時間	34 ms / 2,000 ms
コード長	4,961 bytes
コンパイル時間	1,707 ms
コンパイル使用メモリ	155,528 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-22 16:30:54
合計ジャッジ時間	2,800 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	3 ms 6,816 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	5 ms 6,940 KB
testcase_09	AC	5 ms 6,940 KB
testcase_10	AC	6 ms 6,944 KB
testcase_11	AC	4 ms 6,940 KB
testcase_12	AC	9 ms 6,940 KB
testcase_13	AC	6 ms 6,944 KB
testcase_14	AC	8 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	9 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	22 ms 6,940 KB
testcase_19	AC	13 ms 6,944 KB
testcase_20	AC	3 ms 6,944 KB
testcase_21	AC	28 ms 6,940 KB
testcase_22	AC	34 ms 6,940 KB
testcase_23	AC	1 ms 6,944 KB
testcase_24	AC	1 ms 6,944 KB
testcase_25	AC	1 ms 6,944 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	1 ms 6,944 KB
testcase_28	AC	4 ms 6,940 KB
testcase_29	AC	1 ms 6,944 KB
testcase_30	AC	1 ms 6,940 KB
testcase_31	AC	1 ms 6,940 KB
testcase_32	AC	4 ms 6,940 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 = 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;

enum LIM_INV = 410;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM_INV];
  fac = new Mint[LIM_INV];
  invFac = new Mint[LIM_INV];
  inv[1] = 1;
  foreach (i; 2 .. LIM_INV) {
    inv[i] = -((Mint.M / i) * inv[cast(size_t)(Mint.M % i)]);
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM_INV) {
    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_INV);
      return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
    } else {
      return Mint(0);
    }
  }
}


void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const K = readInt;
      const X = readToken;
      
      auto two = new Mint[M * N + 1];
      two[0] = 1;
      foreach (i; 1 .. M * N + 1) {
        two[i] = two[i - 1] * 2;
      }
      
      // bs[n] := \sum[0<=i<K] binom(n, i)
      auto bs = new Mint[N + 1];
      bs[0] = 1;
      foreach (n; 1 .. N + 1) {
        bs[n] = 2 * bs[n - 1] - binom(n - 1, K - 1);
      }
      
      auto dp = new Mint[][](M + 1, N + 1);
      dp[0][] = Mint(1);
      foreach (m; 1 .. M + 1) {
        if (X[M - m] == '1') {
          foreach (n; K .. N + 1) {
            dp[m][n] = bs[n] * dp[m - 1][n];
          }
        } else {
          // can be sped up
          foreach (n; K .. N + 1) {
            foreach (i; K .. n + 1) {
              dp[m][n] += binom(n, i) * dp[m - 1][i] * two[(m - 1) * (n - i)];
            }
          }
        }
      }
      writeln(dp[M][N]);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード