結果

問題 No.940 ワープ　ε=ε=ε=ε=ε=│;p>д＜│
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-12-03 02:04:04
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 213 ms / 5,000 ms
コード長 4,099 bytes
コンパイル時間 2,638 ms
コンパイル使用メモリ 152,916 KB
実行使用メモリ 42,460 KB
最終ジャッジ日時 2023-09-04 03:33:43
合計ジャッジ時間 7,874 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
42,088 KB
testcase_01 AC 127 ms
41,472 KB
testcase_02 AC 126 ms
42,016 KB
testcase_03 AC 128 ms
42,156 KB
testcase_04 AC 118 ms
40,736 KB
testcase_05 AC 125 ms
40,816 KB
testcase_06 AC 124 ms
41,532 KB
testcase_07 AC 126 ms
40,208 KB
testcase_08 AC 120 ms
40,720 KB
testcase_09 AC 121 ms
40,572 KB
testcase_10 AC 122 ms
40,232 KB
testcase_11 AC 120 ms
41,644 KB
testcase_12 AC 126 ms
42,280 KB
testcase_13 AC 129 ms
41,600 KB
testcase_14 AC 121 ms
41,316 KB
testcase_15 AC 133 ms
40,456 KB
testcase_16 AC 147 ms
41,772 KB
testcase_17 AC 169 ms
41,704 KB
testcase_18 AC 175 ms
41,688 KB
testcase_19 AC 162 ms
41,572 KB
testcase_20 AC 189 ms
40,476 KB
testcase_21 AC 149 ms
42,460 KB
testcase_22 AC 179 ms
41,196 KB
testcase_23 AC 141 ms
40,900 KB
testcase_24 AC 190 ms
41,368 KB
testcase_25 AC 210 ms
40,520 KB
testcase_26 AC 213 ms
42,420 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_) {
  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 == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; 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 if (op == "-") { 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"); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;

enum LIM = 3 * 10^^6;
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);
  }
}

/*
  +1
  -1 +1
  +1 -2 +1
  -1 +3 -3 +1
  +1 -4 +6 -4 +1
  -1 +5 -10 +10 -5 +1
  
   0 +3 -6 +7 -4 -1
  -6 +15 -20 +15 -6
*/

void main() {
  prepare();
  
  try {
    for (; ; ) {
      const X = readInt();
      const Y = readInt();
      const Z = readInt();
      const n = X + Y + Z;
      if (n == 0) {
        writeln(1);
        continue;
      }
      Mint ans;
      Mint coef = 0;
      foreach_reverse (i; 0 .. n + 1) {
        coef = coef * 2 - (-1)^^(n + 1 - i) * binom(n + 1, i + 1);
        ans += coef * binom(X + i - 1, i - 1) * binom(Y + i - 1, i - 1) * binom(Z + i - 1, i - 1);
        debug {
          if (n <= 10) {
            writeln(i, " ", coef);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0