結果

問題 No.3309 Aging Railway
コンテスト
ユーザー Yotugi
提出日時 2025-10-24 21:49:46
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 885 ms / 3,000 ms
コード長 3,292 bytes
コンパイル時間 290 ms
コンパイル使用メモリ 82,240 KB
実行使用メモリ 325,356 KB
最終ジャッジ日時 2025-10-24 21:50:02
合計ジャッジ時間 12,606 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
#set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18 
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import * 

class UnionFind:
    def __init__(self, data,op):
        self.n = len(data)
        self.parents = [-1] * self.n
        self.data = data
        self.op = op 

    def find(self, x):
        t=x
        while self.parents[x] >= 0:
            x=self.parents[x]
        while t!=x:
            self.parents[t],t=x,self.parents[t]
        return x

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        v,ret = self.op(self.data[x],self.data[y])
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        self.data[x] = v 
        return ret 
        
    def get(self,x):
        return self.data[self.find(x)]
    
    def update(self,x,new):
        self.data[self.find(x)] = new
    
    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
    
    def show(self):
        return [self.get(i) for i in range(self.n)]
    

n,m = mi() 
g = defaultdict(list) 
data = []
for _ in range(n-1):
    u,v = gmi()
    data.append((u,v))

def op(u,v):
    if len(u) > len(v):
        u,v = v,u 
    ret = []
    for i in u:
        for j in v:
            ret.append((i,j))
    for i in u:
        v.append(i)
    return v,ret

uf = UnionFind([[i] for i in range(n)],op) 

ans = [0]*(n-1) 
ans[0] = m 


when = [[-1]*n for _ in range(n)]

for i in reversed(range(n-1)):
    u,v = data[i]
    for x,y in uf.union(u,v):
        #print(x,y,i)
        when[x][y] = i
        when[y][x] = i 


for i in range(m):
    u,v = gmi() 
    ans[when[u][v]] -= 1 

for i in range(1,n-1):
    ans[i] += ans[i-1]

print(*ans,sep = "\n")
0