結果
問題 | No.802 だいたい等差数列 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-03-17 21:47:06 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 2,499 bytes |
コンパイル時間 | 1,133 ms |
コンパイル使用メモリ | 121,092 KB |
実行使用メモリ | 53,344 KB |
最終ジャッジ日時 | 2024-06-13 04:20:00 |
合計ジャッジ時間 | 4,744 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
52,532 KB |
testcase_01 | AC | 77 ms
51,668 KB |
testcase_02 | AC | 76 ms
52,756 KB |
testcase_03 | AC | 82 ms
52,664 KB |
testcase_04 | AC | 79 ms
52,012 KB |
testcase_05 | AC | 77 ms
52,088 KB |
testcase_06 | AC | 76 ms
52,240 KB |
testcase_07 | AC | 75 ms
51,364 KB |
testcase_08 | AC | 77 ms
52,356 KB |
testcase_09 | AC | 83 ms
51,596 KB |
testcase_10 | AC | 80 ms
51,056 KB |
testcase_11 | AC | 79 ms
51,804 KB |
testcase_12 | AC | 78 ms
52,928 KB |
testcase_13 | AC | 79 ms
51,704 KB |
testcase_14 | AC | 87 ms
53,328 KB |
testcase_15 | AC | 81 ms
51,432 KB |
testcase_16 | AC | 78 ms
51,644 KB |
testcase_17 | AC | 80 ms
53,004 KB |
testcase_18 | AC | 79 ms
51,576 KB |
testcase_19 | AC | 87 ms
53,344 KB |
testcase_20 | AC | 86 ms
52,692 KB |
testcase_21 | AC | 82 ms
52,772 KB |
testcase_22 | AC | 81 ms
51,640 KB |
testcase_23 | AC | 78 ms
52,568 KB |
testcase_24 | AC | 80 ms
52,896 KB |
testcase_25 | AC | 78 ms
51,736 KB |
testcase_26 | AC | 76 ms
50,984 KB |
testcase_27 | AC | 78 ms
51,852 KB |
testcase_28 | AC | 81 ms
51,180 KB |
testcase_29 | AC | 86 ms
52,388 KB |
testcase_30 | AC | 86 ms
51,984 KB |
testcase_31 | AC | 78 ms
51,500 KB |
testcase_32 | AC | 85 ms
52,232 KB |
testcase_33 | AC | 78 ms
52,656 KB |
ソースコード
import std.conv, std.functional, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); }enum MO = 10L^^9 + 7;enum LIM = 2 * 10^^6;long[] inv, fac, invFac;void prepare() {inv = new long[LIM];fac = new long[LIM];invFac = new long[LIM];inv[1] = 1;foreach (i; 2 .. LIM) {inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;}fac[0] = invFac[0] = 1;foreach (i; 1 .. LIM) {fac[i] = (fac[i - 1] * i) % MO;invFac[i] = (invFac[i - 1] * inv[i]) % MO;}}long binom(long n, long k) {if (0 <= k && k <= n) {assert(n < LIM);return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;} else {return 0;}}long solve(long N, long D, long M) {debug {writefln("N = %s, D = %s, M = %s", N, D, M);}long ans;foreach (i; 0 .. N + 1) {const m = M - (D + 1) * i;if (m >= 0) {debug {if (N <= 10) {writeln(" ", i, " ", m, " ", binom(m + N + 1, N + 1));}}ans += ((i % 2 != 0) ? -1 : +1) * binom(N, i) * binom(m + N + 1, N + 1);ans %= MO;}}ans = (ans % MO + MO) % MO;return ans;}void main() {prepare();try {for (; ; ) {const N = readLong();const M = readLong();const D1 = readLong();const D2 = readLong();const ans = solve(N - 1, D2 - D1, M - 1 - D1 * (N - 1));writeln(ans);}} catch (EOFException e) {}}