結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | yaoshimax |
提出日時 | 2015-05-15 00:59:19 |
言語 | PyPy2 (7.3.15) |
結果 |
AC
|
実行時間 | 139 ms / 5,000 ms |
コード長 | 1,843 bytes |
コンパイル時間 | 1,319 ms |
コンパイル使用メモリ | 77,768 KB |
実行使用メモリ | 80,440 KB |
最終ジャッジ日時 | 2023-09-20 07:55:19 |
合計ジャッジ時間 | 7,556 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
76,160 KB |
testcase_01 | AC | 75 ms
76,328 KB |
testcase_02 | AC | 139 ms
80,100 KB |
testcase_03 | AC | 103 ms
79,888 KB |
testcase_04 | AC | 118 ms
80,076 KB |
testcase_05 | AC | 112 ms
80,196 KB |
testcase_06 | AC | 112 ms
80,132 KB |
testcase_07 | AC | 123 ms
80,204 KB |
testcase_08 | AC | 102 ms
80,028 KB |
testcase_09 | AC | 126 ms
80,252 KB |
testcase_10 | AC | 112 ms
79,924 KB |
testcase_11 | AC | 113 ms
79,928 KB |
testcase_12 | AC | 117 ms
80,140 KB |
testcase_13 | AC | 104 ms
80,072 KB |
testcase_14 | AC | 94 ms
79,272 KB |
testcase_15 | AC | 124 ms
79,996 KB |
testcase_16 | AC | 123 ms
80,240 KB |
testcase_17 | AC | 107 ms
79,936 KB |
testcase_18 | AC | 125 ms
80,180 KB |
testcase_19 | AC | 131 ms
80,136 KB |
testcase_20 | AC | 93 ms
79,348 KB |
testcase_21 | AC | 101 ms
79,332 KB |
testcase_22 | AC | 75 ms
76,460 KB |
testcase_23 | AC | 84 ms
79,584 KB |
testcase_24 | AC | 90 ms
79,648 KB |
testcase_25 | AC | 91 ms
79,480 KB |
testcase_26 | AC | 89 ms
79,384 KB |
testcase_27 | AC | 90 ms
78,808 KB |
testcase_28 | AC | 85 ms
79,636 KB |
testcase_29 | AC | 98 ms
79,088 KB |
testcase_30 | AC | 130 ms
80,136 KB |
testcase_31 | AC | 74 ms
76,416 KB |
testcase_32 | AC | 111 ms
79,984 KB |
testcase_33 | AC | 119 ms
80,440 KB |
testcase_34 | AC | 116 ms
80,132 KB |
testcase_35 | AC | 110 ms
79,980 KB |
testcase_36 | AC | 125 ms
80,152 KB |
testcase_37 | AC | 99 ms
80,120 KB |
testcase_38 | AC | 132 ms
80,164 KB |
testcase_39 | AC | 112 ms
80,252 KB |
ソースコード
N,K=map(int,raw_input().split()) A=map(int,raw_input().split()) mod=1000000007 s=sum(A) S=sum(A) if N>30: for i in range(N,K): s-=A[i%N] A[i%N]=s+A[i%N] A[i%N]%=mod s+=A[i%N] S+=A[i%N] S%=mod s%=mod print A[(K-1)%N],S else: mat=[[0 for i in range(N+1)] for j in range(N+1)] for i in range(N): mat[i][i+1]=1 mat[N][N]=2 mat[N][0]-=1 vec=[0 for i in range(N+1)] vec[0]=0 for i in range(1,N+1): vec[i]=A[i-1]+vec[i-1] m=[[0 for i in range(N+1)] for j in range(N+1)] for i in range(N+1): m[i][i]=1 K-=N while K>0: # for i in range(N+1): # for j in range(N+1): # print m[i][j], # print " ", # for j in range(N+1): # print mat[i][j], # print " ", # print vec[i] # print if K%2==1: m2=[[0 for i in range(N+1)] for j in range(N+1)] for i in range(N+1): for j in range(N+1): for k in range(N+1): m2[i][j]+=mat[i][k]*m[k][j] m2[i][j]%=mod m = m2 mat2=[[0 for i in range(N+1)] for j in range(N+1)] for i in range(N+1): for j in range(N+1): for k in range(N+1): mat2[i][j]+=mat[i][k]*mat[k][j] mat2[i][j]%=mod mat=mat2 K/=2 ans =0 ans2 =0 #for i in range(N+1): # for j in range(N+1): # print m[i][j], # print " ", # for j in range(N+1): # print mat[i][j], # print # print for i in range(N+1): ans+=m[N][i]*vec[i] ans2+=m[N-1][i]*vec[i] ans%=mod ans2%=mod print (ans-ans2)%mod, ans