結果

問題 No.1685 One by One
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-09-17 22:58:31
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 719 ms / 3,000 ms
コード長 4,778 bytes
コンパイル時間 1,351 ms
コンパイル使用メモリ 155,508 KB
実行使用メモリ 132,024 KB
最終ジャッジ日時 2024-06-22 12:32:33
合計ジャッジ時間 13,762 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 3 ms
6,944 KB
testcase_03 AC 62 ms
19,212 KB
testcase_04 AC 14 ms
6,940 KB
testcase_05 AC 304 ms
62,824 KB
testcase_06 AC 104 ms
27,772 KB
testcase_07 AC 229 ms
58,160 KB
testcase_08 AC 5 ms
6,944 KB
testcase_09 AC 15 ms
7,396 KB
testcase_10 AC 559 ms
129,044 KB
testcase_11 AC 16 ms
10,340 KB
testcase_12 AC 6 ms
6,944 KB
testcase_13 AC 358 ms
91,116 KB
testcase_14 AC 75 ms
24,416 KB
testcase_15 AC 397 ms
88,328 KB
testcase_16 AC 12 ms
6,944 KB
testcase_17 AC 10 ms
6,940 KB
testcase_18 AC 12 ms
6,940 KB
testcase_19 AC 3 ms
6,940 KB
testcase_20 AC 206 ms
61,472 KB
testcase_21 AC 214 ms
62,892 KB
testcase_22 AC 231 ms
63,216 KB
testcase_23 AC 256 ms
65,920 KB
testcase_24 AC 553 ms
123,932 KB
testcase_25 AC 688 ms
129,628 KB
testcase_26 AC 575 ms
126,452 KB
testcase_27 AC 625 ms
120,884 KB
testcase_28 AC 615 ms
131,796 KB
testcase_29 AC 719 ms
131,608 KB
testcase_30 AC 650 ms
131,336 KB
testcase_31 AC 708 ms
131,908 KB
testcase_32 AC 714 ms
131,592 KB
testcase_33 AC 715 ms
132,024 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 260 ms
67,444 KB
testcase_39 AC 259 ms
67,612 KB
testcase_40 AC 267 ms
66,896 KB
testcase_41 AC 271 ms
67,124 KB
testcase_42 AC 1 ms
6,940 KB
testcase_43 AC 2 ms
6,940 KB
testcase_44 AC 2 ms
6,940 KB
testcase_45 AC 1 ms
6,940 KB
testcase_46 AC 129 ms
33,588 KB
testcase_47 AC 130 ms
33,600 KB
testcase_48 AC 123 ms
33,656 KB
testcase_49 AC 132 ms
33,624 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(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 = 10^^9 + 7;
alias Mint = ModInt!MO;

enum LIM = 4 * 4000 + 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);
    }
  }
}


void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      
      auto fss = new Mint[][](N, M + N + 1);
      foreach (s; 0 .. N) {
        foreach (a; s .. M + N + 1) {
          // [y^a] (y/(1-y))^s
          fss[s][a] = binom(a - 1, a - s);
        }
        foreach (a; 2 .. M + N - 1) {
          fss[s][a] += fss[s][a - 2];
        }
      }
      
      Mint ans;
      foreach (i; 0 .. (N / 2) + 1) foreach (j; 0 .. (N - 1 - N / 2) + 1) {
        const s = i + j;
        Mint here;
        here += fss[s][M];
        if (N % 2 != 0) {
          const a = M - N + 2 * max(i, j);
          if (a >= 0) {
            here += fss[s][a];
          }
        }
        ans += invFac[i] * invFac[j] * invFac[N - i - j] * here;
      }
      ans *= fac[N];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0