結果

問題 No.997 Jumping Kangaroo
ユーザー mkawa2mkawa2
提出日時 2020-02-22 11:30:25
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 34 ms / 2,000 ms
コード長 2,928 bytes
コンパイル時間 84 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 11,136 KB
最終ジャッジ日時 2024-04-17 22:13:25
合計ジャッジ時間 1,743 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
10,880 KB
testcase_01 AC 29 ms
11,008 KB
testcase_02 AC 26 ms
10,880 KB
testcase_03 AC 28 ms
11,008 KB
testcase_04 AC 28 ms
10,880 KB
testcase_05 AC 29 ms
10,880 KB
testcase_06 AC 27 ms
11,136 KB
testcase_07 AC 30 ms
10,880 KB
testcase_08 AC 27 ms
11,008 KB
testcase_09 AC 26 ms
10,880 KB
testcase_10 AC 26 ms
10,880 KB
testcase_11 AC 26 ms
11,008 KB
testcase_12 AC 26 ms
10,880 KB
testcase_13 AC 26 ms
10,880 KB
testcase_14 AC 31 ms
11,008 KB
testcase_15 AC 29 ms
10,880 KB
testcase_16 AC 34 ms
10,880 KB
testcase_17 AC 28 ms
10,880 KB
testcase_18 AC 30 ms
11,008 KB
testcase_19 AC 28 ms
11,008 KB
testcase_20 AC 30 ms
10,880 KB
testcase_21 AC 27 ms
11,136 KB
testcase_22 AC 28 ms
11,008 KB
testcase_23 AC 29 ms
11,008 KB
testcase_24 AC 27 ms
10,880 KB
testcase_25 AC 29 ms
10,880 KB
testcase_26 AC 30 ms
11,008 KB
testcase_27 AC 27 ms
10,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

class mint:
    def __init__(self, x):
        self.__x = x % md

    def __str__(self):
        return str(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))

class Fibonacci:
    def __init__(self):
        coeff = [dp[w*2],dp[w]]
        self.f0 = [1, dp[w]]
        # 上２つは問題ごとに手作業で設定
        # af(n)+bf(n+1)+cf(n+2)+df(n+3)=f(n+4)みたいなとき
        # coeff=[a,b,c,d]
        # 初期値f0(f(0)からf(3))
        n = len(coeff)
        ff = [[0] * n for _ in range(2 * n - 1)]
        for i in range(n): ff[i][i] = mint(1)
        for i in range(n, 2 * n - 1):
            ffi = ff[i]
            for j, c in enumerate(coeff, i - n):
                ffj = ff[j]
                for k in range(n): ffi[k] += c * ffj[k]
        self.bn = 1 << (n - 1).bit_length()
        self.base = ff[self.bn]
        self.ff = ff
        self.n = n

    def __mm(self, aa, bb):
        n = self.n
        res = [0] * (n * 2 - 1)
        for i, a in enumerate(aa):
            for j, b in enumerate(bb):
                res[i + j] += a * b
        for i in range(n, 2 * n - 1):
            c = res[i]
            ffi = self.ff[i]
            for j in range(n):
                res[j] += c * ffi[j]
        return res[:n]

    def v(self, x):
        base = self.base
        aa = self.ff[x % self.bn]
        x //= self.bn
        while x:
            if x & 1: aa = self.__mm(aa, base)
            base = self.__mm(base, base)
            x >>= 1
        return sum(a * f for a, f in zip(aa, self.f0))

md = 10**9+7

n,w,k=MI()
aa=LI()
dp=[0]*(2*w+1)
dp[0]=1
for i in range(2*w):
    pre=dp[i]
    if pre==0 or i==w:continue
    for a in aa:
        if i+a<=2*w:dp[i+a]+=pre
# print(dp)
# pt(k)=pt(k-1)*dp[w]+pt(k-2)*dp[w*2]
fb=Fibonacci()
print(fb.v(k))
0