結果

問題 No.2292 Interval Union Find
ユーザー t98slidert98slider
提出日時 2023-04-08 15:56:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,420 ms / 5,000 ms
コード長 5,026 bytes
コンパイル時間 374 ms
コンパイル使用メモリ 82,296 KB
実行使用メモリ 266,368 KB
最終ジャッジ日時 2024-04-14 13:15:44
合計ジャッジ時間 52,745 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
54,864 KB
testcase_01 AC 39 ms
54,580 KB
testcase_02 AC 38 ms
53,808 KB
testcase_03 AC 38 ms
54,788 KB
testcase_04 AC 1,029 ms
140,636 KB
testcase_05 AC 1,035 ms
143,232 KB
testcase_06 AC 1,029 ms
140,356 KB
testcase_07 AC 1,063 ms
145,960 KB
testcase_08 AC 1,420 ms
259,392 KB
testcase_09 AC 1,362 ms
259,028 KB
testcase_10 AC 1,325 ms
258,800 KB
testcase_11 AC 1,306 ms
258,128 KB
testcase_12 AC 1,319 ms
263,188 KB
testcase_13 AC 1,295 ms
244,688 KB
testcase_14 AC 1,323 ms
246,352 KB
testcase_15 AC 1,344 ms
257,808 KB
testcase_16 AC 1,327 ms
245,528 KB
testcase_17 AC 1,370 ms
258,044 KB
testcase_18 AC 675 ms
266,368 KB
testcase_19 AC 856 ms
262,116 KB
testcase_20 AC 859 ms
261,780 KB
testcase_21 AC 1,180 ms
265,340 KB
testcase_22 AC 1,218 ms
264,956 KB
testcase_23 AC 1,209 ms
264,520 KB
testcase_24 AC 1,205 ms
265,128 KB
testcase_25 AC 1,216 ms
265,340 KB
testcase_26 AC 1,217 ms
264,368 KB
testcase_27 AC 1,217 ms
266,012 KB
testcase_28 AC 1,173 ms
265,104 KB
testcase_29 AC 1,216 ms
264,524 KB
testcase_30 AC 1,185 ms
264,528 KB
testcase_31 AC 1,246 ms
264,784 KB
testcase_32 AC 1,208 ms
265,864 KB
testcase_33 AC 1,217 ms
265,448 KB
testcase_34 AC 1,250 ms
265,000 KB
testcase_35 AC 1,244 ms
265,636 KB
testcase_36 AC 1,211 ms
265,596 KB
testcase_37 AC 1,210 ms
265,272 KB
testcase_38 AC 1,241 ms
264,956 KB
testcase_39 AC 1,209 ms
264,952 KB
testcase_40 AC 1,226 ms
264,956 KB
testcase_41 AC 395 ms
121,648 KB
testcase_42 AC 422 ms
121,796 KB
testcase_43 AC 692 ms
125,672 KB
testcase_44 AC 847 ms
125,112 KB
testcase_45 AC 807 ms
125,212 KB
testcase_46 AC 812 ms
125,924 KB
testcase_47 AC 885 ms
124,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import stdin

class lazy_segtree():
    def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
    def all_apply(self,k,f):
        self.d[k]=self.mapping(f,self.d[k])
        if (k<self.size):self.lz[k]=self.composition(f,self.lz[k])
    def push(self,k):
        self.all_apply(2*k,self.lz[k])
        self.all_apply(2*k+1,self.lz[k])
        self.lz[k]=self.identity
    def __init__(self,V,OP,E,MAPPING,COMPOSITION,ID):
        self.n=len(V)
        self.log=(self.n-1).bit_length()
        self.size=1<<self.log
        self.d=[E for i in range(2*self.size)]
        self.lz=[ID for i in range(self.size)]
        self.e=E
        self.op=OP
        self.mapping=MAPPING
        self.composition=COMPOSITION
        self.identity=ID
        for i in range(self.n):self.d[self.size+i]=V[i]
        for i in range(self.size-1,0,-1):self.update(i)
    def set(self,p,x):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=x
        for i in range(1,self.log+1):self.update(p>>i)
    def get(self,p):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        return self.d[p]
    def prod(self,l,r):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return self.e
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push(r>>i)
        sml,smr=self.e,self.e
        while(l<r):
            if l&1:
                sml=self.op(sml,self.d[l])
                l+=1
            if r&1:
                r-=1
                smr=self.op(self.d[r],smr)
            l>>=1
            r>>=1
        return self.op(sml,smr)
    def all_prod(self):return self.d[1]
    def apply_point(self,p,f):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=self.mapping(f,self.d[p])
        for i in range(1,self.log+1):self.update(p>>i)
    def apply(self,l,r,f):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push((r-1)>>i)
        l2,r2=l,r
        while(l<r):
            if (l&1):
                self.all_apply(l,f)
                l+=1
            if (r&1):
                r-=1
                self.all_apply(r,f)
            l>>=1
            r>>=1
        l,r=l2,r2
        for i in range(1,self.log+1):
            if (((l>>i)<<i)!=l):self.update(l>>i)
            if (((r>>i)<<i)!=r):self.update((r-1)>>i)
    def max_right(self,l,g):
        assert 0<=l and l<=self.n
        assert g(self.e)
        if l==self.n:return self.n
        l+=self.size
        for i in range(self.log,0,-1):self.push(l>>i)
        sm=self.e
        while(1):
            while(l%2==0):l>>=1
            if not(g(self.op(sm,self.d[l]))):
                while(l<self.size):
                    self.push(l)
                    l=(2*l)
                    if (g(self.op(sm,self.d[l]))):
                        sm=self.op(sm,self.d[l])
                        l+=1
                return l-self.size
            sm=self.op(sm,self.d[l])
            l+=1
            if (l&-l)==l:break
        return self.n
    def min_left(self,r,g):
        assert (0<=r and r<=self.n)
        assert g(self.e)
        if r==0:return 0
        r+=self.size
        for i in range(self.log,0,-1):self.push((r-1)>>i)
        sm=self.e
        while(1):
            r-=1
            while(r>1 and (r%2)):r>>=1
            if not(g(self.op(self.d[r],sm))):
                while(r<self.size):
                    self.push(r)
                    r=(2*r+1)
                    if g(self.op(self.d[r],sm)):
                        sm=self.op(self.d[r],sm)
                        r-=1
                return r+1-self.size
            sm=self.op(self.d[r],sm)
            if (r&-r)==r:break
        return 0

def op(lhs, rhs): return lhs & rhs
def mapping(f, x): return x if f == -1 else f
def composition(f, g): return g if f == -1 else f

N, Q = map(int, stdin.readline().split())
query = [[] for _ in range(Q)]
compress = [0]

for i in range(Q):
    query[i] = list(map(int, stdin.readline().split()))
    compress.append(query[i][1])
    if len(query[i]) >= 3: compress.append(query[i][2])

compress = sorted(list(set(compress)))

d = {compress[i] : i for i in range(len(compress))}

uf = lazy_segtree([0] * len(compress), op, 1, mapping, composition, -1)

for i in range(Q):
    typ, u, v = query[i][0], d[query[i][1]], d[query[i][2]] if len(query[i]) >= 3  else 0
    if typ <= 2: uf.apply(u, v, 2 - typ)
    elif typ == 3:
        if v < u : u, v = v, u 
        print(uf.prod(u, v))
    else:
        l = uf.min_left(u, lambda x : x != 0)
        r = uf.max_right(u, lambda x : x != 0)
        print(compress[r] - compress[l] + 1)
0