#520413 (D) No.1138 No Bingo!

提出ソース

結果

問題	No.1138 No Bingo!
ユーザー	👑 hos.lyric
提出日時	2020-07-30 01:54:04
言語	D (dmd 2.106.1)
結果	AC
実行時間	113 ms / 3,000 ms
コード長	6,699 bytes
コンパイル時間	1,375 ms
コンパイル使用メモリ	153,820 KB
実行使用メモリ	11,244 KB
最終ジャッジ日時	2023-09-04 08:45:21
合計ジャッジ時間	4,808 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	14 ms 7,920 KB
testcase_01	AC	15 ms 9,708 KB
testcase_02	AC	15 ms 8,672 KB
testcase_03	AC	60 ms 10,708 KB
testcase_04	AC	112 ms 10,640 KB
testcase_05	AC	14 ms 7,944 KB
testcase_06	AC	15 ms 7,868 KB
testcase_07	AC	15 ms 9,660 KB
testcase_08	AC	15 ms 7,944 KB
testcase_09	AC	62 ms 9,972 KB
testcase_10	AC	111 ms 9,964 KB
testcase_11	AC	113 ms 11,244 KB
testcase_12	AC	37 ms 8,924 KB
testcase_13	AC	20 ms 9,932 KB
testcase_14	AC	112 ms 9,992 KB
testcase_15	AC	61 ms 9,672 KB
testcase_16	AC	112 ms 9,928 KB
testcase_17	AC	111 ms 9,912 KB
testcase_18	AC	112 ms 9,704 KB
testcase_19	AC	64 ms 10,232 KB
testcase_20	AC	112 ms 10,036 KB
testcase_21	AC	111 ms 10,752 KB
testcase_22	AC	110 ms 9,964 KB
testcase_23	AC	17 ms 8,192 KB
testcase_24	AC	63 ms 9,392 KB
testcase_25	AC	60 ms 9,660 KB
testcase_26	AC	37 ms 9,972 KB
testcase_27	AC	61 ms 9,464 KB
testcase_28	AC	37 ms 9,968 KB
testcase_29	AC	37 ms 9,504 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(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; }
}

// M: prime, G: primitive root
class Fft(int M_, int G, int K) {
  import std.algorithm : reverse;
  import std.traits : isIntegral;
  alias M = M_;
  // 1, 1/4, 1/8, 3/8, 1/16, 5/16, 3/16, 7/16, ...
  int[] gs;
  this() {
    static assert(2 <= K && K <= 30, "Fft: 2 <= K <= 30 must hold");
    static assert(!((M - 1) & ((1 << K) - 1)), "Fft: 2^K | M - 1 must hold");
    gs = new int[1 << (K - 1)];
    gs[0] = 1;
    long g2 = G, gg = 1;
    for (int e = (M - 1) >> K; e; e >>= 1) {
      if (e & 1) gg = (gg * g2) % M;
      g2 = (g2 * g2) % M;
    }
    gs[1 << (K - 2)] = cast(int)(gg);
    for (int l = 1 << (K - 2); l >= 2; l >>= 1) {
      gs[l >> 1] = cast(int)((cast(long)(gs[l]) * gs[l]) % M);
    }
    assert((cast(long)(gs[1]) * gs[1]) % M == M - 1,
           "Fft: g^(2^(K-1)) == -1 (mod M) must hold");
    for (int l = 2; l <= 1 << (K - 2); l <<= 1) {
      foreach (i; 1 .. l) {
        gs[l + i] = cast(int)((cast(long)(gs[l]) * gs[i]) % M);
      }
    }
  }
  void fft(int[] xs) const {
    const n = cast(int)(xs.length);
    assert(!(n & (n - 1)), "Fft.fft: |xs| must be a power of two");
    assert(n <= 1 << K, "Fft.fft: |xs| <= 2^K must hold");
    for (int l = n; l >>= 1; ) {
      foreach (i; 0 .. (n >> 1) / l) {
        const(long) g = gs[i];
        foreach (j; (i << 1) * l .. (i << 1 | 1) * l) {
          const t = cast(int)((g * xs[j + l]) % M);
          if ((xs[j + l] = xs[j] - t) < 0) xs[j + l] += M;
          if ((xs[j] += t) >= M) xs[j] -= M;
        }
      }
    }
  }
  void invFft(int[] xs) const {
    const n = cast(int)(xs.length);
    assert(!(n & (n - 1)), "Fft.invFft: |xs| must be a power of two");
    assert(n <= 1 << K, "Fft.invFft: |xs| <= 2^K must hold");
    for (int l = 1; l < n; l <<= 1) reverse(xs[l .. l << 1]);
    for (int l = 1; l < n; l <<= 1) {
      foreach (i; 0 .. (n >> 1) / l) {
        const(long) g = gs[i];
        foreach (j; (i << 1) * l .. (i << 1 | 1) * l) {
          int t = cast(int)((g * (xs[j] - xs[j + l])) % M);
          if (t < 0) t += M;
          if ((xs[j] += xs[j + l]) >= M) xs[j] -= M;
          xs[j + l] = t;
        }
      }
    }
  }
}


enum MO = 998244353;
alias Mint = ModInt!MO;
alias Fft0 = Fft!(998244353, 3, 20);

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 (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);
  }
}

void main() {
  const FFT = new Fft0;
  prepare;
  
  auto der = new Mint[LIM];
  der[0] = 1;
  der[1] = 0;
  foreach (i; 2 .. LIM) {
    der[i] = (i - 1) * (der[i - 1] + der[i - 2]);
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      
      int fftN;
      for (fftN = 4; fftN < N + 1; fftN <<= 1) {}
      auto fs = new int[fftN];
      fs[0] = 1;
      fs[1] = 4;
      fs[2] = 2;
      FFT.fft(fs);
      foreach (i; 0 .. fftN) {
        fs[i] = (Mint(fs[i])^^(N / 2)).x;
      }
      FFT.invFft(fs);
      const invFftN = Mint(fftN).inv;
      auto gs = new Mint[N + 1];
      foreach (i; 0 .. N + 1) {
        gs[i] = fs[i] * invFftN;
      }
      
      if (N % 2 != 0) {
        foreach_reverse (i; 0 .. N) {
          gs[i + 1] += gs[i];
        }
      }
      debug {
        writeln("gs = ", gs);
      }
      
      Mint ans;
      foreach (i; 0 .. N + 1) {
        ans += (-1)^^(i & 1) * fac[N - i] * gs[i];
      }
      ans = fac[N] - der[N] - der[N] + ans;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード