結果
問題 | No.901 K-ary εxtrεεmε |
ユーザー | chineristAC |
提出日時 | 2020-09-27 22:40:45 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,059 bytes |
コンパイル時間 | 324 ms |
コンパイル使用メモリ | 87,240 KB |
実行使用メモリ | 186,108 KB |
最終ジャッジ日時 | 2023-09-13 03:50:35 |
合計ジャッジ時間 | 26,679 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 87 ms
71,888 KB |
testcase_02 | AC | 110 ms
77,996 KB |
testcase_03 | AC | 109 ms
77,880 KB |
testcase_04 | AC | 107 ms
77,884 KB |
testcase_05 | AC | 107 ms
77,960 KB |
testcase_06 | AC | 108 ms
77,820 KB |
testcase_07 | AC | 897 ms
175,388 KB |
testcase_08 | AC | 908 ms
176,328 KB |
testcase_09 | AC | 847 ms
168,388 KB |
testcase_10 | AC | 891 ms
175,876 KB |
testcase_11 | AC | 866 ms
177,176 KB |
testcase_12 | AC | 830 ms
167,076 KB |
testcase_13 | AC | 860 ms
168,488 KB |
testcase_14 | AC | 858 ms
164,728 KB |
testcase_15 | AC | 838 ms
165,180 KB |
testcase_16 | AC | 839 ms
164,556 KB |
testcase_17 | AC | 916 ms
179,484 KB |
testcase_18 | AC | 904 ms
182,132 KB |
testcase_19 | AC | 923 ms
180,732 KB |
testcase_20 | AC | 905 ms
177,812 KB |
testcase_21 | AC | 902 ms
181,156 KB |
testcase_22 | AC | 808 ms
159,420 KB |
testcase_23 | AC | 828 ms
163,256 KB |
testcase_24 | AC | 823 ms
164,408 KB |
testcase_25 | AC | 803 ms
162,372 KB |
testcase_26 | AC | 846 ms
167,196 KB |
testcase_27 | AC | 906 ms
184,492 KB |
testcase_28 | AC | 898 ms
184,912 KB |
testcase_29 | AC | 931 ms
186,108 KB |
ソースコード
import sys from collections import deque input = sys.stdin.readline N = int(input()) edge = [[] for i in range(N)] for i in range(N-1): u,v,w = map(int,input().split()) edge[u].append((v,w)) edge[v].append((u,w)) color_tree_edge = [set([]) for i in range(N)] Q = int(input()) color = [list(map(int,input().split()))[1:] for i in range(Q)] for i in range(Q): for v in color[i]: color_tree_edge[v].add(i) #合流点の検出 deq = deque([0]) parent = [-1 for i in range(N)] depth = [0 for i in range(N)] parent[0] = 0 topo = [] while deq: v = deq.popleft() topo.append(v) for nv,cost in edge[v]: if parent[nv]==-1: parent[nv] = v depth[nv] = depth[v] + cost deq.append(nv) topo = topo[::-1] node = [set([]) for v in range(N)] size = [1 for i in range(N)] for i in range(Q): for v in color[i]: node[v].add(i) for v in topo: for nv,cost in edge[v]: if nv!=parent[v]: size[v] += size[nv] if len(node[v]) < len(node[nv]): node[nv],node[v] = node[v],node[nv] for nv,cost in edge[v]: if nv!=parent[v]: for color in node[nv]: if color in node[v]: color_tree_edge[v].add(color) else: node[v].add(color) node[nv] = None res = [0 for i in range(Q)] #辺の張り直し vertex = [] def euler_tour(v,pv): vertex.append(v) for nv,cost in edge[v]: if nv!=pv: euler_tour(nv,v) vertex.append(v) euler_tour(0,0) color_parent = [-1 for i in range(N+1)] visit = [None for i in range(N+1)] for v in vertex: if visit[v] is None: visit[v] = {} for nc in color_tree_edge[v]: if color_parent[nc]!=-1: res[nc] += depth[v] - depth[color_parent[nc]] visit[v][nc] = color_parent[nc] color_parent[nc] = v else: for nc in visit[v]: color_parent[nc] = visit[v][nc] for i in range(Q): print(res[i])