結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-04-08 16:40:54 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 216 ms / 2,000 ms |
コード長 | 2,290 bytes |
コンパイル時間 | 712 ms |
コンパイル使用メモリ | 110,704 KB |
実行使用メモリ | 87,264 KB |
最終ジャッジ日時 | 2023-09-04 00:27:05 |
合計ジャッジ時間 | 24,050 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 176 ms
76,244 KB |
testcase_01 | AC | 174 ms
76,376 KB |
testcase_02 | AC | 173 ms
75,584 KB |
testcase_03 | AC | 175 ms
75,636 KB |
testcase_04 | AC | 174 ms
76,608 KB |
testcase_05 | AC | 170 ms
76,024 KB |
testcase_06 | AC | 175 ms
76,052 KB |
testcase_07 | AC | 175 ms
75,732 KB |
testcase_08 | AC | 201 ms
76,052 KB |
testcase_09 | AC | 181 ms
78,524 KB |
testcase_10 | AC | 183 ms
77,380 KB |
testcase_11 | AC | 182 ms
78,960 KB |
testcase_12 | AC | 185 ms
77,852 KB |
testcase_13 | AC | 195 ms
81,868 KB |
testcase_14 | AC | 179 ms
77,608 KB |
testcase_15 | AC | 174 ms
74,592 KB |
testcase_16 | AC | 176 ms
77,616 KB |
testcase_17 | AC | 170 ms
77,744 KB |
testcase_18 | AC | 201 ms
83,316 KB |
testcase_19 | AC | 201 ms
75,896 KB |
testcase_20 | AC | 173 ms
76,836 KB |
testcase_21 | AC | 184 ms
75,320 KB |
testcase_22 | AC | 187 ms
75,096 KB |
testcase_23 | AC | 178 ms
76,296 KB |
testcase_24 | AC | 173 ms
75,180 KB |
testcase_25 | AC | 170 ms
74,728 KB |
testcase_26 | AC | 171 ms
76,448 KB |
testcase_27 | AC | 177 ms
74,940 KB |
testcase_28 | AC | 176 ms
77,808 KB |
testcase_29 | AC | 177 ms
74,848 KB |
testcase_30 | AC | 172 ms
76,516 KB |
testcase_31 | AC | 180 ms
76,072 KB |
testcase_32 | AC | 179 ms
74,928 KB |
testcase_33 | AC | 178 ms
77,796 KB |
testcase_34 | AC | 178 ms
75,980 KB |
testcase_35 | AC | 179 ms
77,496 KB |
testcase_36 | AC | 187 ms
75,876 KB |
testcase_37 | AC | 194 ms
76,952 KB |
testcase_38 | AC | 173 ms
75,564 KB |
testcase_39 | AC | 172 ms
76,552 KB |
testcase_40 | AC | 178 ms
75,600 KB |
testcase_41 | AC | 181 ms
75,888 KB |
testcase_42 | AC | 192 ms
76,048 KB |
testcase_43 | AC | 174 ms
76,788 KB |
testcase_44 | AC | 177 ms
77,064 KB |
testcase_45 | AC | 180 ms
77,048 KB |
testcase_46 | AC | 186 ms
76,208 KB |
testcase_47 | AC | 184 ms
75,464 KB |
testcase_48 | AC | 185 ms
76,364 KB |
testcase_49 | AC | 206 ms
87,264 KB |
testcase_50 | AC | 185 ms
76,032 KB |
testcase_51 | AC | 184 ms
76,768 KB |
testcase_52 | AC | 183 ms
77,588 KB |
testcase_53 | AC | 179 ms
75,356 KB |
testcase_54 | AC | 184 ms
77,908 KB |
testcase_55 | AC | 176 ms
76,268 KB |
testcase_56 | AC | 177 ms
78,372 KB |
testcase_57 | AC | 193 ms
78,612 KB |
testcase_58 | AC | 193 ms
82,556 KB |
testcase_59 | AC | 193 ms
78,924 KB |
testcase_60 | AC | 191 ms
79,624 KB |
testcase_61 | AC | 216 ms
86,524 KB |
testcase_62 | AC | 199 ms
78,176 KB |
testcase_63 | AC | 212 ms
82,736 KB |
testcase_64 | AC | 182 ms
78,220 KB |
testcase_65 | AC | 178 ms
77,132 KB |
testcase_66 | AC | 183 ms
77,772 KB |
testcase_67 | AC | 186 ms
76,900 KB |
testcase_68 | AC | 192 ms
77,196 KB |
testcase_69 | AC | 173 ms
75,660 KB |
testcase_70 | AC | 170 ms
77,076 KB |
testcase_71 | AC | 169 ms
75,896 KB |
testcase_72 | AC | 168 ms
76,740 KB |
testcase_73 | AC | 197 ms
76,824 KB |
testcase_74 | AC | 171 ms
77,504 KB |
testcase_75 | AC | 179 ms
77,392 KB |
testcase_76 | AC | 176 ms
75,988 KB |
testcase_77 | AC | 178 ms
76,528 KB |
testcase_78 | AC | 176 ms
76,116 KB |
testcase_79 | AC | 174 ms
76,104 KB |
testcase_80 | AC | 176 ms
77,204 KB |
testcase_81 | AC | 167 ms
75,876 KB |
testcase_82 | AC | 175 ms
74,488 KB |
testcase_83 | AC | 178 ms
75,608 KB |
testcase_84 | AC | 174 ms
76,828 KB |
testcase_85 | AC | 178 ms
76,024 KB |
testcase_86 | AC | 178 ms
76,872 KB |
testcase_87 | AC | 185 ms
74,980 KB |
testcase_88 | AC | 182 ms
75,732 KB |
testcase_89 | AC | 188 ms
79,032 KB |
testcase_90 | AC | 191 ms
79,832 KB |
testcase_91 | AC | 202 ms
84,272 KB |
testcase_92 | AC | 174 ms
76,720 KB |
testcase_93 | AC | 198 ms
79,884 KB |
testcase_94 | AC | 178 ms
76,812 KB |
testcase_95 | AC | 192 ms
78,924 KB |
testcase_96 | AC | 192 ms
81,320 KB |
testcase_97 | AC | 189 ms
80,020 KB |
testcase_98 | AC | 180 ms
78,676 KB |
ソースコード
import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, 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 = 3 * 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; } } int M; int N; int[] H; void main() { prepare(); for (string line; (line = readln) !is null; ) { M = line.chomp.to!int; H = readln.chomp.split.map!(to!int).array; debug { writeln("M = ", M, ", H = ", H); } N = cast(int)(H.length); if (H == [0]) { writeln(1); } else { const lot = M - (H.sum + N - 1); if (lot < 0) { writeln("NA"); } else { // H(N + 1, lot) const ans = binom(N + 1 + lot - 1, lot); writeln(ans); } } } }