結果
問題 | No.1035 Color Box |
ユーザー | Coki628 |
提出日時 | 2020-10-26 18:22:40 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 147 ms / 2,000 ms |
コード長 | 1,759 bytes |
コンパイル時間 | 424 ms |
コンパイル使用メモリ | 87,472 KB |
実行使用メモリ | 83,844 KB |
最終ジャッジ日時 | 2023-09-29 02:43:53 |
合計ジャッジ時間 | 6,247 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 147 ms
83,844 KB |
testcase_01 | AC | 85 ms
75,892 KB |
testcase_02 | AC | 72 ms
71,664 KB |
testcase_03 | AC | 99 ms
76,720 KB |
testcase_04 | AC | 103 ms
77,976 KB |
testcase_05 | AC | 94 ms
77,028 KB |
testcase_06 | AC | 74 ms
71,776 KB |
testcase_07 | AC | 85 ms
77,460 KB |
testcase_08 | AC | 138 ms
83,116 KB |
testcase_09 | AC | 120 ms
80,288 KB |
testcase_10 | AC | 83 ms
76,360 KB |
testcase_11 | AC | 81 ms
75,940 KB |
testcase_12 | AC | 81 ms
75,948 KB |
testcase_13 | AC | 136 ms
81,860 KB |
testcase_14 | AC | 142 ms
82,552 KB |
testcase_15 | AC | 145 ms
83,716 KB |
testcase_16 | AC | 74 ms
71,568 KB |
testcase_17 | AC | 73 ms
71,568 KB |
testcase_18 | AC | 72 ms
71,464 KB |
testcase_19 | AC | 143 ms
83,788 KB |
testcase_20 | AC | 74 ms
71,676 KB |
testcase_21 | AC | 76 ms
71,740 KB |
testcase_22 | AC | 75 ms
71,672 KB |
testcase_23 | AC | 74 ms
71,704 KB |
testcase_24 | AC | 74 ms
71,560 KB |
testcase_25 | AC | 72 ms
71,716 KB |
testcase_26 | AC | 74 ms
71,624 KB |
testcase_27 | AC | 74 ms
71,592 KB |
testcase_28 | AC | 74 ms
71,584 KB |
testcase_29 | AC | 75 ms
71,620 KB |
testcase_30 | AC | 75 ms
71,772 KB |
testcase_31 | AC | 75 ms
71,596 KB |
testcase_32 | AC | 73 ms
71,740 KB |
testcase_33 | AC | 73 ms
71,436 KB |
testcase_34 | AC | 74 ms
71,580 KB |
testcase_35 | AC | 72 ms
71,724 KB |
testcase_36 | AC | 75 ms
71,556 KB |
testcase_37 | AC | 76 ms
71,600 KB |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)] def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10**9) INF = 10**19 MOD = 10**9 + 7 EPS = 10**-10 class ModTools: """ 階乗・逆元用のテーブルを構築する """ def __init__(self, MAX, MOD): MAX += 1 self.MAX = MAX self.MOD = MOD factorial = [1] * MAX factorial[0] = factorial[1] = 1 for i in range(2, MAX): factorial[i] = factorial[i-1] * i % MOD inverse = [1] * MAX inverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD) for i in range(MAX-2, -1, -1): inverse[i] = inverse[i+1] * (i+1) % MOD self.fact = factorial self.inv = inverse def nCr(self, n, r): """ 組み合わせ """ if n < r: return 0 r = min(r, n-r) numerator = self.fact[n] denominator = self.inv[r] * self.inv[n-r] % self.MOD return numerator * denominator % self.MOD N, K = MAP() mt = ModTools(max(N, K)+1, MOD) ans = 0 for i in range(K+1): if i % 2 == 0: ans += mt.nCr(K, i) * pow(K-i, N, MOD) % MOD else: ans -= mt.nCr(K, i) * pow(K-i, N, MOD) % MOD print(ans%MOD)