結果
問題 | No.1227 I hate ThREE |
ユーザー | chineristAC |
提出日時 | 2020-09-11 22:57:33 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 2,846 bytes |
コンパイル時間 | 1,169 ms |
コンパイル使用メモリ | 87,212 KB |
実行使用メモリ | 102,464 KB |
最終ジャッジ日時 | 2023-08-30 14:44:33 |
合計ジャッジ時間 | 6,031 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,460 KB |
testcase_01 | AC | 75 ms
71,272 KB |
testcase_02 | AC | 75 ms
71,576 KB |
testcase_03 | AC | 108 ms
78,640 KB |
testcase_04 | AC | 104 ms
77,648 KB |
testcase_05 | AC | 107 ms
77,512 KB |
testcase_06 | AC | 74 ms
71,392 KB |
testcase_07 | AC | 76 ms
71,376 KB |
testcase_08 | AC | 95 ms
76,512 KB |
testcase_09 | AC | 93 ms
76,684 KB |
testcase_10 | AC | 84 ms
75,792 KB |
testcase_11 | AC | 101 ms
76,628 KB |
testcase_12 | AC | 109 ms
77,516 KB |
testcase_13 | AC | 89 ms
75,972 KB |
testcase_14 | AC | 92 ms
76,796 KB |
testcase_15 | AC | 96 ms
76,744 KB |
testcase_16 | AC | 98 ms
76,544 KB |
testcase_17 | AC | 102 ms
76,536 KB |
testcase_18 | AC | 110 ms
78,336 KB |
testcase_19 | AC | 107 ms
78,160 KB |
testcase_20 | AC | 113 ms
78,276 KB |
testcase_21 | AC | 76 ms
71,260 KB |
testcase_22 | AC | 96 ms
76,652 KB |
testcase_23 | AC | 195 ms
102,464 KB |
testcase_24 | AC | 174 ms
98,200 KB |
testcase_25 | AC | 134 ms
86,828 KB |
testcase_26 | AC | 114 ms
78,304 KB |
testcase_27 | AC | 114 ms
78,080 KB |
testcase_28 | AC | 108 ms
78,700 KB |
testcase_29 | AC | 114 ms
78,444 KB |
testcase_30 | AC | 108 ms
78,044 KB |
testcase_31 | AC | 108 ms
77,808 KB |
testcase_32 | AC | 112 ms
78,404 KB |
testcase_33 | AC | 105 ms
78,388 KB |
testcase_34 | AC | 111 ms
78,288 KB |
testcase_35 | AC | 103 ms
77,288 KB |
ソースコード
import sys input = sys.stdin.readline sys.setrecursionlimit(2*10**5) mod = 10**9+7 N,C = map(int,input().split()) edge = [[] for i in range(N)] for i in range(N-1): a,b = map(int,input().split()) edge[a-1].append(b-1) edge[b-1].append(a-1) depth = [-1 for i in range(N)] parent = [-1 for i in range(N)] size = [1 for i in range(N)] depth[0] = 0 def dfs(v,pv): for nv in edge[v]: if nv!=pv: parent[nv] = v depth[nv] = depth[v] + 1 dfs(nv,v) size[v] += size[nv] dfs(0,-1) D = max(depth) def solve(M): if M<=2*D+1: dp = [[1 for i in range(M)] for j in range(N)] def dp_dfs(v,pv): for nv in edge[v]: if nv!=pv: dp_dfs(nv,v) for i in range(M): tmp = 0 if i!=0: tmp += dp[nv][i-1] if i!=M-1: tmp += dp[nv][i+1] tmp %= mod dp[v][i] *= tmp dp[v][i] %= mod dp_dfs(0,-1) res = 0 for i in range(M): res += dp[0][i] res %= mod return res else: dp_low = [[1 for i in range(D+1)] for j in range(N)] dp_high = [[1 for i in range(D+1)] for j in range(N)] def dp_dfs(v,pv): for nv in edge[v]: if nv!=pv: dp_dfs(nv,v) for i in range(D+1): tmp = 0 if i!=0: tmp += dp_low[nv][i-1] if i!=D: tmp += dp_low[nv][i+1] else: tmp += pow(2,size[nv]-1,mod) tmp %= mod dp_low[v][i] *= tmp dp_low[v][i] %= mod tmp = 0 if i!=0: tmp += dp_high[nv][i-1] if i!=D: tmp += dp_high[nv][i+1] else: tmp += pow(2,size[nv]-1,mod) tmp %= mod dp_high[v][i] *= tmp dp_high[v][i] %= mod dp_dfs(0,-1) res = 0 for i in range(D+1): res += dp_low[0][i] res %= mod res += dp_high[0][i] res %= mod tmp = pow(2,N-1,mod) * (M-2*D-2) %mod res += tmp res %= mod return res ans = 0 c = C//3 if C%3==1: ans += solve(c+1) + 2*solve(c) ans %= mod elif C%3==2: ans += 2*solve(c+1) + solve(c) ans %= mod else: ans = 3*solve(c) ans %= mod print(ans)