結果

問題 No.1790 Subtree Deletion
ユーザー mkawa2mkawa2
提出日時 2021-12-19 00:52:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 718 ms / 3,000 ms
コード長 6,925 bytes
コンパイル時間 395 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 107,008 KB
最終ジャッジ日時 2024-09-15 14:21:52
合計ジャッジ時間 9,072 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
53,376 KB
testcase_01 AC 41 ms
53,760 KB
testcase_02 AC 41 ms
53,376 KB
testcase_03 AC 697 ms
105,728 KB
testcase_04 AC 686 ms
105,344 KB
testcase_05 AC 703 ms
106,496 KB
testcase_06 AC 718 ms
105,864 KB
testcase_07 AC 702 ms
105,836 KB
testcase_08 AC 159 ms
78,208 KB
testcase_09 AC 477 ms
106,624 KB
testcase_10 AC 633 ms
107,008 KB
testcase_11 AC 643 ms
105,728 KB
testcase_12 AC 494 ms
104,448 KB
testcase_13 AC 542 ms
99,376 KB
testcase_14 AC 363 ms
84,480 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 = 18446744073709551615
# inf = 4294967295
# md = 10**9+7
md = 998244353

class LazySegTree:
    def __init__(self, op, e, mapping, composition, _id, v):
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = _id

        if isinstance(v, int):
            v = [e]*v

        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e]*(2*self._size)
        self._lz = [self._id]*self._size
        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):
        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):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left, right):
        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]

    def apply(self, left, right, f):
        if right is None:
            p = left
            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)
        else:
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right-1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log+1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right-1) >> i)

    def max_right(self, left, g):
        if left == self._n:
            return self._n

        left += self._size
        for i in range(self._log, 0, -1):
            self._push(left >> i)

        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not g(self._op(sm, self._d[left])):
                while left < self._size:
                    self._push(left)
                    left *= 2
                    if g(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left-self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right, g):
        if right == 0:
            return 0

        right += self._size
        for i in range(self._log, 0, -1):
            self._push((right-1) >> i)

        sm = self._e
        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right%2:
                right >>= 1
            if not g(self._op(self._d[right], sm)):
                while right < self._size:
                    self._push(right)
                    right = 2*right+1
                    if g(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right+1-self._size
            sm = self._op(self._d[right], sm)

        return 0

    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._id

# treeのマージ
# 32bit以上を区間長とした例
def op(x, y):
    return x ^ y

# treeの単位元
e = 0

# lazy(f)からtree(x)への操作
def mapping(f, x):
    if f == -1: return x
    return f

# lazyの下への分解
def composition(f, g):
    if f == -1: return g
    return f

# lazyの単位元
_id = -1

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

st = [(0, True)]
par = [-1]*n
ll = [-1]*n
rr = [-1]*n
vv = [0]*n
uu = []
while st:
    u, f = st.pop()
    if f:
        st.append((u, False))
        ll[u] = len(uu)
        uu.append(u)
        for v, a in to[u]:
            if v == par[u]: continue
            par[v] = u
            vv[v] = a
            st.append((v, True))
    else:
        rr[u] = len(uu)
# pDB(vv)
# pDB(uu)
# pDB(ll)
# pDB(rr)

vv = [vv[u] for u in uu]
seg = LazySegTree(op, e, mapping, composition, _id, vv)
# pDB(vv)

for _ in range(II()):
    t, x = LI1()
    l = ll[x]
    r = rr[x]
    if t == 0:
        seg.apply(l, r, 0)
    else:
        print(seg.prod(l+1, r))
0