結果
問題 | No.140 みんなで旅行 |
ユーザー | 👑 hos.lyric |
提出日時 | 2015-01-29 23:35:15 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 26 ms / 5,000 ms |
コード長 | 2,805 bytes |
コンパイル時間 | 1,354 ms |
コンパイル使用メモリ | 109,560 KB |
実行使用メモリ | 32,124 KB |
最終ジャッジ日時 | 2023-09-02 19:44:06 |
合計ジャッジ時間 | 2,618 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
31,888 KB |
testcase_01 | AC | 19 ms
31,148 KB |
testcase_02 | AC | 21 ms
31,792 KB |
testcase_03 | AC | 20 ms
31,328 KB |
testcase_04 | AC | 20 ms
30,396 KB |
testcase_05 | AC | 21 ms
31,324 KB |
testcase_06 | AC | 21 ms
31,112 KB |
testcase_07 | AC | 20 ms
30,256 KB |
testcase_08 | AC | 20 ms
31,080 KB |
testcase_09 | AC | 20 ms
30,240 KB |
testcase_10 | AC | 20 ms
30,812 KB |
testcase_11 | AC | 25 ms
30,156 KB |
testcase_12 | AC | 21 ms
30,148 KB |
testcase_13 | AC | 21 ms
30,852 KB |
testcase_14 | AC | 25 ms
31,896 KB |
testcase_15 | AC | 26 ms
32,124 KB |
testcase_16 | AC | 22 ms
31,764 KB |
testcase_17 | AC | 21 ms
30,320 KB |
testcase_18 | AC | 23 ms
31,200 KB |
testcase_19 | AC | 24 ms
30,396 KB |
testcase_20 | AC | 20 ms
30,812 KB |
testcase_21 | AC | 20 ms
31,420 KB |
ソースコード
import core.thread; import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex; // Input class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; } int readInt() { return to!int(readToken); } long readLong() { return to!long(readToken); } real readReal() { return to!real(readToken); } // chmin/chmax void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } // Pair struct Pair(S, T) { S x; T y; int opCmp( const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; } int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; } string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; } } auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); } // Array int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a < val); }); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); } T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; } immutable MO = 10L^^9 + 7; immutable LIM = 555 * 2 + 5; long[] inv, fac, facInv; long[][] bn, S; int N; void main(string[] args) { inv = new long[LIM]; inv[1] = 1; foreach (i; 2 .. LIM) { inv[i] = MO - MO / i * inv[cast(size_t)(MO % i)] % MO; } fac = new long[LIM]; facInv = new long[LIM]; fac[0] = facInv[0] = 1; foreach (i; 1 .. LIM) { fac[i] = fac[i - 1] * i % MO; facInv[i] = facInv[i - 1] * inv[i] % MO; } bn = new long[][](LIM, LIM); foreach (n; 0 .. LIM) { bn[n][0] = 1; bn[n][n] = 1; foreach (k; 1 .. n) { bn[n][k] = (bn[n - 1][k - 1] + bn[n - 1][k]) % MO; } } S = new long[][](LIM, LIM); foreach (n; 0 .. LIM) { S[n][0] = 0; S[n][n] = 1; foreach (k; 1 .. n) { S[n][k] = (S[n - 1][k - 1] + k * S[n - 1][k]) % MO; } } try { for (; ; ) { N = readInt; long ans; foreach (k; 1 .. N + 1) { long sep = 1; foreach_reverse (x; k .. N + 1) { long tmp = 1; (tmp *= bn[N][x]) %= MO; (tmp *= S[x][k]) %= MO; (tmp *= sep) %= MO; debug{ if(N<=3)writeln(k," ",x," ",bn[N][x]," ",S[x][k]," ",sep," ",tmp); } (ans += tmp) %= MO; (sep *= (k * (k - 1))) %= MO; } } writeln(ans); } } catch (EOFException) {} }