結果
問題 | No.898 tri-βutree |
ユーザー | maspy |
提出日時 | 2020-02-29 18:49:03 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,369 ms / 4,000 ms |
コード長 | 2,112 bytes |
コンパイル時間 | 860 ms |
コンパイル使用メモリ | 11,024 KB |
実行使用メモリ | 147,256 KB |
最終ジャッジ日時 | 2023-08-08 16:42:24 |
合計ジャッジ時間 | 27,337 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,052 ms
134,016 KB |
testcase_01 | AC | 127 ms
30,068 KB |
testcase_02 | AC | 126 ms
30,104 KB |
testcase_03 | AC | 127 ms
30,132 KB |
testcase_04 | AC | 130 ms
30,204 KB |
testcase_05 | AC | 128 ms
30,220 KB |
testcase_06 | AC | 128 ms
30,160 KB |
testcase_07 | AC | 1,294 ms
146,976 KB |
testcase_08 | AC | 1,285 ms
147,052 KB |
testcase_09 | AC | 1,330 ms
147,256 KB |
testcase_10 | AC | 1,299 ms
147,092 KB |
testcase_11 | AC | 1,284 ms
147,184 KB |
testcase_12 | AC | 1,276 ms
147,184 KB |
testcase_13 | AC | 1,265 ms
147,180 KB |
testcase_14 | AC | 1,297 ms
147,128 KB |
testcase_15 | AC | 1,310 ms
146,868 KB |
testcase_16 | AC | 1,369 ms
146,992 KB |
testcase_17 | AC | 1,282 ms
146,940 KB |
testcase_18 | AC | 1,274 ms
146,916 KB |
testcase_19 | AC | 1,303 ms
147,084 KB |
testcase_20 | AC | 1,281 ms
147,124 KB |
testcase_21 | AC | 1,306 ms
147,152 KB |
ソースコード
#!/usr/bin/env python3 # %% import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines # %% import numpy as np # %% N = int(readline()) UVW = tuple(tuple(map(int, readline().split()) for _ in range(N - 1))) Q = int(readline()) XYZ = np.array(read().split(), np.int64) + 1 X = XYZ[::3] Y = XYZ[1::3] Z = XYZ[2::3] # %% G = [[] for _ in range(N + 1)] for u, v, w in UVW: G[u + 1].append((v + 1, w)) G[v + 1].append((u + 1, w)) # %% def EulerTour(graph, root=1): V = len(graph) par = [0] * V depth = [0] * V weight = [0] * V depth[root] = 0 tour = [root] st = [root] while st: x = st[-1] if not graph[x]: st.pop() tour.append(par[x]) continue y, c = graph[x].pop() if y == par[x]: continue par[y] = x depth[y] = depth[x] + 1 weight[y] = weight[x] + c st.append(y) tour.append(y) return par, tour, depth, weight # %% par, tour, depth, weight = EulerTour(G) # %% Ltour = len(tour) tour_arr = np.array(tour) depth_arr = np.array(depth) tour_d = depth_arr[tour_arr] idx = np.arange(len(depth)) idx[tour_arr] = np.arange(Ltour) # %% sp = np.empty((Ltour.bit_length(), Ltour), np.int32) sp[0] = np.arange(Ltour) for n in range(1, Ltour.bit_length()): prev, width = sp[n - 1], 1 << (n - 1) x = prev[:-width] y = prev[width:] condition = tour_d[x] > tour_d[y] sp[n] = prev sp[n, :-width][condition] = y[condition] # %% def LCA(A, B): AB = np.vstack([A, B]).T LR = idx[AB] LR.sort(axis=1) # [L,R] におけるRmQ L = LR[:, 0] R = LR[:, 1] x = R - L n = np.zeros_like(x) # 2^n <= R-L for _ in range(20): x >>= 1 n[x > 0] += 1 x = sp[n, L] y = sp[n, R - (1 << n) + 1] return np.where(tour_d[x] < tour_d[y], tour_arr[x], tour_arr[y]) # %% XY = LCA(X, Y) XZ = LCA(X, Z) YZ = LCA(Z, Y) # %% A = np.array(weight) answer = A[X] + A[Y] + A[Z] - A[XY] - A[XZ] - A[YZ] print('\n'.join(answer.astype(str)))