結果
問題 | No.1227 I hate ThREE |
ユーザー | WSKR |
提出日時 | 2020-09-22 00:20:58 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,461 bytes |
コンパイル時間 | 768 ms |
コンパイル使用メモリ | 87,124 KB |
実行使用メモリ | 125,892 KB |
最終ジャッジ日時 | 2023-09-07 05:16:24 |
合計ジャッジ時間 | 14,154 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 96 ms
71,840 KB |
testcase_01 | AC | 98 ms
71,596 KB |
testcase_02 | AC | 105 ms
71,724 KB |
testcase_03 | AC | 150 ms
79,300 KB |
testcase_04 | AC | 151 ms
79,112 KB |
testcase_05 | AC | 157 ms
80,700 KB |
testcase_06 | AC | 96 ms
71,404 KB |
testcase_07 | WA | - |
testcase_08 | AC | 202 ms
83,200 KB |
testcase_09 | AC | 174 ms
82,104 KB |
testcase_10 | AC | 159 ms
80,316 KB |
testcase_11 | AC | 546 ms
120,872 KB |
testcase_12 | AC | 615 ms
125,332 KB |
testcase_13 | AC | 128 ms
77,096 KB |
testcase_14 | AC | 165 ms
81,636 KB |
testcase_15 | AC | 187 ms
84,816 KB |
testcase_16 | AC | 284 ms
95,636 KB |
testcase_17 | AC | 217 ms
87,576 KB |
testcase_18 | AC | 342 ms
103,180 KB |
testcase_19 | AC | 297 ms
97,264 KB |
testcase_20 | AC | 376 ms
105,324 KB |
testcase_21 | AC | 117 ms
77,424 KB |
testcase_22 | AC | 307 ms
98,044 KB |
testcase_23 | WA | - |
testcase_24 | AC | 604 ms
125,684 KB |
testcase_25 | WA | - |
testcase_26 | AC | 483 ms
120,944 KB |
testcase_27 | AC | 530 ms
123,964 KB |
testcase_28 | AC | 546 ms
124,944 KB |
testcase_29 | AC | 534 ms
124,912 KB |
testcase_30 | AC | 495 ms
121,892 KB |
testcase_31 | AC | 532 ms
122,084 KB |
testcase_32 | AC | 552 ms
124,696 KB |
testcase_33 | AC | 485 ms
121,628 KB |
testcase_34 | AC | 498 ms
123,296 KB |
testcase_35 | AC | 491 ms
121,136 KB |
ソースコード
#i hate three 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-4): 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-5: tmp_u += dp[child][i+3] elif i+3 > 3*N-5: 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-3, 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-3: 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-4)) + sum(dp[1][i] for i in range(3*N-3, 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()