結果
問題 | No.391 CODING WAR |
ユーザー | mkawa2 |
提出日時 | 2020-04-15 07:36:44 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 972 ms / 2,000 ms |
コード長 | 2,213 bytes |
コンパイル時間 | 123 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 34,688 KB |
最終ジャッジ日時 | 2024-10-01 18:38:17 |
合計ジャッジ時間 | 11,709 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 281 ms
34,560 KB |
testcase_01 | AC | 295 ms
34,560 KB |
testcase_02 | AC | 291 ms
34,560 KB |
testcase_03 | AC | 287 ms
34,560 KB |
testcase_04 | AC | 289 ms
34,560 KB |
testcase_05 | AC | 286 ms
34,688 KB |
testcase_06 | AC | 291 ms
34,688 KB |
testcase_07 | AC | 293 ms
34,688 KB |
testcase_08 | AC | 303 ms
34,688 KB |
testcase_09 | AC | 972 ms
34,560 KB |
testcase_10 | AC | 866 ms
34,560 KB |
testcase_11 | AC | 283 ms
34,688 KB |
testcase_12 | AC | 286 ms
34,688 KB |
testcase_13 | AC | 936 ms
34,688 KB |
testcase_14 | AC | 830 ms
34,560 KB |
testcase_15 | AC | 904 ms
34,560 KB |
testcase_16 | AC | 660 ms
34,432 KB |
testcase_17 | AC | 708 ms
34,688 KB |
testcase_18 | AC | 571 ms
34,688 KB |
testcase_19 | AC | 584 ms
34,560 KB |
ソースコード
from itertools import permutations import sys sys.setrecursionlimit(10 ** 6) from bisect import * from collections import * from heapq import * def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def SI(): return sys.stdin.readline()[:-1] def LLI(rows_number): return [LI() for _ in range(rows_number)] int1 = lambda x: int(x) - 1 def MI1(): return map(int1, sys.stdin.readline().split()) def LI1(): return list(map(int1, sys.stdin.readline().split())) p2D = lambda x: print(*x, sep="\n") dij = [(1, 0), (0, 1), (-1, 0), (0, -1)] # grobalにmdを設定すること class mint: def __init__(self, x): self.__x = x % md def __str__(self): return str(self.__x) def __neg__(self): return mint(-self.__x) def __add__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x + other) def __sub__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x - other) def __rsub__(self, other): return mint(other - self.__x) def __mul__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x * other) __radd__ = __add__ __rmul__ = __mul__ def __truediv__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x * pow(other, md - 2, md)) def __rtruediv__(self, other): return mint(other * pow(self.__x, md - 2, md)) def __pow__(self, power, modulo=None): return mint(pow(self.__x, power, md)) md = 10**9+7 def nCr(com_n, com_r): if com_n < com_r: return 0 return fac[com_n] * ifac[com_r] * ifac[com_n - com_r] n_max = 100005 fac = [mint(1)] for i in range(1, n_max + 1): fac.append(fac[-1] * i) ifac = [mint(1)] * (n_max + 1) ifac[n_max] /= fac[n_max] for i in range(n_max - 1, 1, -1): ifac[i] = ifac[i + 1] * (i + 1) def main(): n,m=MI() if m>n: print(0) exit() ans=mint(0) for i in range(m): if i&1:ans-=pow(m-i,n,md)*nCr(m,i) else:ans+=pow(m-i,n,md)*nCr(m,i) print(ans) main()