結果

問題 No.3309 Aging Railway
コンテスト
ユーザー mkawa2
提出日時 2025-10-24 22:06:02
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 820 ms / 3,000 ms
コード長 2,841 bytes
コンパイル時間 247 ms
コンパイル使用メモリ 82,584 KB
実行使用メモリ 132,564 KB
最終ジャッジ日時 2025-10-24 22:06:26
合計ジャッジ時間 12,803 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class LCA:
    def __init__(self, parent, depth):
        self.n = n = len(parent)
        self._depth = depth
        log = max(self._depth).bit_length()
        self._table = [parent]+[[-1]*n for _ in range(log)]
        self._mn = [[n]+[uv2i[u, parent[u]] for u in range(1, n)]]+[[n]*n for _ in range(log)]
        t0 = self._table[0]
        m0 = self._mn[0]
        for lv in range(log):
            t1 = self._table[lv+1]
            m1 = self._mn[lv+1]
            for u in range(n):
                if t0[u] == -1: continue
                t1[u] = t0[t0[u]]
                m1[u] = min(m0[u], m0[t0[u]])
            t0 = t1
            m0 = m1

    def anc(self, u, v):
        diff = self._depth[u]-self._depth[v]
        if diff < 0: u, v = v, u
        diff = abs(diff)
        u, mn = self.up(u, diff)
        if u == v: return u, mn
        for lv in range(self._depth[u].bit_length()-1, -1, -1):
            tl = self._table[lv]
            if tl[u] != tl[v]:
                mn = min(mn, self._mn[lv][u], self._mn[lv][v])
                u, v = tl[u], tl[v]
        return self._table[0][u], min(mn, self._mn[0][u], self._mn[0][v])

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

n, m = LI()
to = [[] for _ in range(n)]
uv2i = {}
for i in range(n-1):
    u, v = LI1()
    to[u].append(v)
    to[v].append(u)
    uv2i[u, v] = uv2i[v, u] = i
st = LLI1(m)

def dfs(root=0):
    uu, stack = [], [root]
    while stack:
        u = stack.pop()
        uu.append(u)
        for v in to[u]:
            if v == parent[u]: continue
            parent[v] = u
            depth[v] = depth[u]+1
            stack.append(v)
    return uu

parent, depth = [-1]*n, [0]*n
uu = dfs()
lca = LCA(parent, depth)
ans = [0]*(n-1)
ans[0] = m
for s, t in st:
    _, mn = lca.anc(s, t)
    ans[mn] -= 1
for i in range(n-2): ans[i+1] += ans[i]
print(*ans, sep="\n")
0