結果

問題 No.901 K-ary εxtrεεmε
ユーザー mkawa2mkawa2
提出日時 2023-03-21 22:28:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 532 ms / 3,000 ms
コード長 2,925 bytes
コンパイル時間 1,015 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 112,204 KB
最終ジャッジ日時 2023-10-18 18:38:11
合計ジャッジ時間 16,837 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 341 ms
112,204 KB
testcase_01 AC 38 ms
53,584 KB
testcase_02 AC 98 ms
76,344 KB
testcase_03 AC 90 ms
76,080 KB
testcase_04 AC 93 ms
76,344 KB
testcase_05 AC 93 ms
76,176 KB
testcase_06 AC 93 ms
76,164 KB
testcase_07 AC 467 ms
105,196 KB
testcase_08 AC 463 ms
103,984 KB
testcase_09 AC 494 ms
103,168 KB
testcase_10 AC 481 ms
104,800 KB
testcase_11 AC 470 ms
104,816 KB
testcase_12 AC 474 ms
104,932 KB
testcase_13 AC 470 ms
104,440 KB
testcase_14 AC 477 ms
104,340 KB
testcase_15 AC 477 ms
104,428 KB
testcase_16 AC 478 ms
103,524 KB
testcase_17 AC 470 ms
104,404 KB
testcase_18 AC 482 ms
104,084 KB
testcase_19 AC 468 ms
104,044 KB
testcase_20 AC 467 ms
103,980 KB
testcase_21 AC 473 ms
104,608 KB
testcase_22 AC 511 ms
104,380 KB
testcase_23 AC 501 ms
105,008 KB
testcase_24 AC 518 ms
109,796 KB
testcase_25 AC 532 ms
104,940 KB
testcase_26 AC 510 ms
105,236 KB
testcase_27 AC 368 ms
104,272 KB
testcase_28 AC 364 ms
103,760 KB
testcase_29 AC 361 ms
103,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

class LCA:
    def __init__(self, parents, depth):
        self.n = len(parents)
        self.parents = parents
        self.depth = depth
        self.max_level = max(self.depth).bit_length()
        self.ancestor = [self.parents]+[[-1]*self.n for _ in range(self.max_level)]
        row0 = self.ancestor[0]
        for lv in range(self.max_level):
            row1 = self.ancestor[lv+1]
            for u in range(self.n):
                if row0[u] == -1: continue
                row1[u] = row0[row0[u]]
            row0 = row1

    def anc(self, u, v):
        diff = self.depth[u]-self.depth[v]
        if diff < 0: u, v = v, u
        diff = abs(diff)
        u = self.up(u, diff)
        if u == v: return u
        for lv in range(self.depth[u].bit_length()-1, -1, -1):
            anclv = self.ancestor[lv]
            if anclv[u] != anclv[v]: u, v = anclv[u], anclv[v]
        return self.parents[u]

    def up(self, u, dist):
        lv = 0
        while dist and u != -1:
            if dist & 1: u = self.ancestor[lv][u]
            lv, dist = lv+1, dist >> 1
        return u

def dfs(root=0):
    uu = [root]
    dfsOrder[root] = 0
    stack = [(u, root, w) for u, w in to[root]]
    while stack:
        u, p, w = stack.pop()
        if u >= 0 and dfsOrder[u] == -1:
            dist[u] = dist[p]+w
            parent[u] = p
            depth[u] = depth[p]+1
            dfsOrder[u] = len(uu)
            uu.append(u)
            stack.append((-1, u, 0))
            to_par = False
            for v, w in to[u]:
                if v != p or to_par: stack.append((v, u, w))
                if v == p: to_par = True

    return uu

n = II()
to = [[] for _ in range(n)]
for _ in range(n-1):
    u, v, w = LI()
    to[u].append((v, w))
    to[v].append((u, w))

parent, depth, dfsOrder = [-1]*n, [0]*n, [-1]*n
dist = [0]*n
dfs()

lca = LCA(parent, depth)

for _ in range(II()):
    k, *xx = LI()
    xx.sort(key=lambda x: dfsOrder[x])
    r = u = xx[0]
    ans = 0
    for x in xx[1:]:
        a = lca.anc(u, x)
        if depth[a] < depth[r]:
            ans += dist[x]+dist[r]-2*dist[a]
            r = a
        else:
            ans += dist[x]-dist[a]
        u = x
    print(ans)
0