結果
問題 | No.1102 Remnants |
ユーザー | mkawa2 |
提出日時 | 2020-07-10 00:06:31 |
言語 | Python3 (3.11.6 + numpy 1.26.0 + scipy 1.11.3) |
結果 |
AC
|
実行時間 | 1,505 ms / 2,000 ms |
コード長 | 1,757 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 10,768 KB |
実行使用メモリ | 49,084 KB |
最終ジャッジ日時 | 2023-07-30 04:19:21 |
合計ジャッジ時間 | 17,819 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 17 ms
8,064 KB |
testcase_01 | AC | 17 ms
8,008 KB |
testcase_02 | AC | 17 ms
8,016 KB |
testcase_03 | AC | 17 ms
8,016 KB |
testcase_04 | AC | 17 ms
8,084 KB |
testcase_05 | AC | 1,204 ms
37,652 KB |
testcase_06 | AC | 208 ms
13,544 KB |
testcase_07 | AC | 1,505 ms
49,084 KB |
testcase_08 | AC | 38 ms
8,812 KB |
testcase_09 | AC | 78 ms
9,880 KB |
testcase_10 | AC | 25 ms
8,444 KB |
testcase_11 | AC | 60 ms
9,476 KB |
testcase_12 | AC | 85 ms
10,136 KB |
testcase_13 | AC | 79 ms
9,852 KB |
testcase_14 | AC | 665 ms
23,384 KB |
testcase_15 | AC | 522 ms
21,836 KB |
testcase_16 | AC | 1,386 ms
44,544 KB |
testcase_17 | AC | 1,289 ms
42,200 KB |
testcase_18 | AC | 1,290 ms
43,480 KB |
testcase_19 | AC | 441 ms
20,324 KB |
testcase_20 | AC | 145 ms
11,820 KB |
testcase_21 | AC | 780 ms
29,264 KB |
testcase_22 | AC | 1,111 ms
38,356 KB |
testcase_23 | AC | 861 ms
31,224 KB |
testcase_24 | AC | 607 ms
24,700 KB |
testcase_25 | AC | 1,333 ms
44,156 KB |
testcase_26 | AC | 89 ms
10,276 KB |
testcase_27 | AC | 350 ms
17,440 KB |
ソースコード
import sys sys.setrecursionlimit(10 ** 6) 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)] def LLI1(rows_number): return [LI1() 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)] class mint: def __init__(self, x): self.__x = x % md def __repr__(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 n,k=MI() aa=MI() hh=[-1,mint(1)] for i in range(1,n):hh.append(hh[-1]*(k+i)/i) ans=mint(0) for i,a in enumerate(aa): ans+=a*hh[i+1]*hh[n-i] print(ans)