結果

問題 No.1054 Union add query
コンテスト
ユーザー 回転
提出日時 2025-09-12 20:58:38
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,472 bytes
コンパイル時間 4,468 ms
コンパイル使用メモリ 81,924 KB
実行使用メモリ 296,556 KB
最終ジャッジ日時 2025-09-12 21:15:46
合計ジャッジ時間 25,674 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 6 TLE * 2
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.retu = [[i] for i in range(n)]

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        if(len(self.retu[x]) <= len(self.retu[y])):
            for i in self.retu[x]:
                self.retu[y].append(i)
            self.retu[x],self.retu[y] = self.retu[y],self.retu[x]
        else:
            for i in self.retu[y]:
                self.retu[x].append(i)

    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 segfunc(x,y):
    return x+y
class LazySegTree_RAQ:
    def __init__(self,init_val,segfunc,ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1<<(n-1).bit_length()
        self.tree = [ide_ele]*2*self.num
        self.lazy = [0]*2*self.num
        for i in range(n):
            self.tree[self.num+i] = init_val[i]
        for i in range(self.num-1,0,-1):
            self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1])
    def gindex(self,l,r):
        l += self.num
        r += self.num
        lm = l>>(l&-l).bit_length()
        rm = r>>(r&-r).bit_length()
        while r>l:
            if l<=lm:
                yield l
            if r<=rm:
                yield r
            r >>= 1
            l >>= 1
        while l:
            yield l
            l >>= 1
    def propagates(self,*ids):
        for i in reversed(ids):
            v = self.lazy[i]
            if v==0:
                continue
            self.lazy[i] = 0
            self.lazy[2*i] += v
            self.lazy[2*i+1] += v
            self.tree[2*i] += v
            self.tree[2*i+1] += v
    def add(self,l,r,x):
        ids = self.gindex(l,r)
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                self.lazy[l] += x
                self.tree[l] += x
                l += 1
            if r&1:
                self.lazy[r-1] += x
                self.tree[r-1] += x
            r >>= 1
            l >>= 1
        for i in ids:
            self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1]) + self.lazy[i]
    def query(self,l,r):
        self.propagates(*self.gindex(l,r))
        res = self.ide_ele
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                res = self.segfunc(res,self.tree[l])
                l += 1
            if r&1:
                res = self.segfunc(res,self.tree[r-1])
            l >>= 1
            r >>= 1
        return res

from collections import defaultdict
N,Q = list(map(int,input().split()))
query = [list(map(int,input().split())) for _ in range(Q)]

uf = UnionFind(N)
for i in range(Q):
    t,a,b, = query[i]
    a -= 1;b -= 1
    if(t == 1):
        uf.union(a,b)

v = []
done = set()
for i in range(N):
    p = uf.find(i)
    if(p in done):continue
    done.add(p)
    v += uf.retu[p]

place = defaultdict(int)
for i in range(N):
    place[v[i]] = i

uf = UnionFind(N)
T = LazySegTree_RAQ([0 for _ in range(N)],segfunc,0)
for i in range(Q):
    t,a,b, = query[i]
    if(t == 1):
        a -= 1;b -= 1
        uf.union(a,b)
    elif(t == 2):
        a -= 1
        ap = uf.find(a)
        head = uf.retu[ap][0]
        end = uf.retu[ap][-1]
        T.add(place[head],place[end]+1,b) 
    else:
        a -= 1
        p = place[a]
        print(T.query(p,p+1))
0