結果
問題 | No.1227 I hate ThREE |
ユーザー | iby |
提出日時 | 2020-11-29 00:48:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 582 ms / 2,000 ms |
コード長 | 3,466 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 87,092 KB |
実行使用メモリ | 125,992 KB |
最終ジャッジ日時 | 2023-10-11 02:06:15 |
合計ジャッジ時間 | 13,929 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,852 KB |
testcase_01 | AC | 90 ms
71,736 KB |
testcase_02 | AC | 89 ms
71,600 KB |
testcase_03 | AC | 141 ms
79,232 KB |
testcase_04 | AC | 138 ms
79,044 KB |
testcase_05 | AC | 144 ms
80,748 KB |
testcase_06 | AC | 87 ms
71,796 KB |
testcase_07 | AC | 90 ms
71,720 KB |
testcase_08 | AC | 164 ms
83,396 KB |
testcase_09 | AC | 160 ms
82,420 KB |
testcase_10 | AC | 137 ms
80,440 KB |
testcase_11 | AC | 515 ms
120,956 KB |
testcase_12 | AC | 562 ms
125,240 KB |
testcase_13 | AC | 119 ms
77,268 KB |
testcase_14 | AC | 157 ms
81,608 KB |
testcase_15 | AC | 176 ms
84,480 KB |
testcase_16 | AC | 272 ms
95,552 KB |
testcase_17 | AC | 206 ms
87,948 KB |
testcase_18 | AC | 329 ms
103,220 KB |
testcase_19 | AC | 285 ms
97,232 KB |
testcase_20 | AC | 349 ms
105,416 KB |
testcase_21 | AC | 108 ms
77,480 KB |
testcase_22 | AC | 289 ms
98,048 KB |
testcase_23 | AC | 566 ms
124,280 KB |
testcase_24 | AC | 582 ms
125,548 KB |
testcase_25 | AC | 576 ms
125,992 KB |
testcase_26 | AC | 467 ms
121,016 KB |
testcase_27 | AC | 506 ms
123,784 KB |
testcase_28 | AC | 517 ms
124,956 KB |
testcase_29 | AC | 494 ms
124,796 KB |
testcase_30 | AC | 470 ms
122,144 KB |
testcase_31 | AC | 488 ms
122,136 KB |
testcase_32 | AC | 519 ms
124,368 KB |
testcase_33 | AC | 473 ms
121,564 KB |
testcase_34 | AC | 484 ms
123,372 KB |
testcase_35 | AC | 467 ms
121,156 KB |
ソースコード
#skip problem -> from collections import deque mod = 10**9 + 7 def main(): N, C = map(int, input().split()) G = [[] for i in range(N+1)] for i in range(N-1): a, b = map(int, input().split()) G[a].append(b) G[b].append(a) visited = [False for i in range(N+1)] depth = [0 for i in range(N+1)] child_cnt = [1 for i in range(N+1)] que = deque([]) def dfs(s_node): visited[s_node] = True for child in G[s_node]: if visited[child] == False: depth[child] = depth[s_node] + 1 dfs(child) for child in G[s_node]: if depth[child] > depth[s_node]: child_cnt[s_node] += child_cnt[child] que.append(s_node) dfs(1) if C > 9*N: dp = [[0 for i in range(6*N-5)] for i in range(N+1)] while que: node = que.popleft() for i in range(3*N-3): has_child = False v = 1 for child in G[node]: if depth[child] > depth[node]: tmp_u = 0 has_child = True if i >= 3: tmp_u += dp[child][i-3] if i+3 <= 3*N-4: tmp_u += dp[child][i+3] elif i+3 > 3*N-4: tmp_u += pow(2, child_cnt[child]-1, mod) v *= tmp_u v %= mod dp[node][i] = v if has_child == False: dp[node][i] = 1 for i in range(3*N-2, 6*N-5): has_child = False v = 1 for child in G[node]: if depth[child] > depth[node]: tmp_u = 0 has_child = True if i+3 <= 6*N-6: tmp_u += dp[child][i+3] if i-3 >= 3*N-2: tmp_u += dp[child][i-3] else: tmp_u += pow(2, child_cnt[child]-1, mod) v *= tmp_u v %= mod dp[node][i] = v if has_child == False: dp[node][i] = 1 ans = sum(dp[1][i] for i in range(3*N-3)) + sum(dp[1][i] for i in range(3*N-2, 6*N-5)) + (C-6*N + 6)*pow(2, N-1, mod) print(ans % mod) return elif C <= 9*N: dp = [[0 for i in range(C+1)] for j in range(N+1)] while que: node = que.popleft() for i in range(1, C+1): has_child = False v = 1 for child in G[node]: if depth[child] > depth[node]: has_child = True tmp_u = 0 if 1 <= i-3 <= C: tmp_u += dp[child][i-3] if 1 <= i+3 <= C: tmp_u += dp[child][i+3] v *= (tmp_u) v %= mod dp[node][i] = v % mod if has_child == False: dp[node][i] = 1 ans = sum(dp[1][i] for i in range(1, C+1)) % mod print(ans) return if __name__ == "__main__": main()