#836441 (PyPy3) No.899 γatheree

提出ソース

結果

問題	No.899 γatheree
ユーザー	tktk_snsn
提出日時	2023-02-01 23:04:15
言語	PyPy3 (7.3.15)
結果	AC
実行時間	1,720 ms / 2,000 ms
コード長	11,557 bytes
コンパイル時間	192 ms
コンパイル使用メモリ	82,176 KB
実行使用メモリ	115,072 KB
最終ジャッジ日時	2024-07-01 15:58:59
合計ジャッジ時間	32,443 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	87 ms 74,752 KB
testcase_01	AC	135 ms 80,768 KB
testcase_02	AC	131 ms 80,640 KB
testcase_03	AC	137 ms 80,768 KB
testcase_04	AC	133 ms 80,896 KB
testcase_05	AC	137 ms 80,256 KB
testcase_06	AC	1,720 ms 112,896 KB
testcase_07	AC	1,547 ms 113,408 KB
testcase_08	AC	1,510 ms 112,640 KB
testcase_09	AC	1,590 ms 112,984 KB
testcase_10	AC	1,516 ms 112,384 KB
testcase_11	AC	1,546 ms 112,512 KB
testcase_12	AC	1,633 ms 113,144 KB
testcase_13	AC	1,560 ms 112,824 KB
testcase_14	AC	1,539 ms 112,256 KB
testcase_15	AC	1,477 ms 112,384 KB
testcase_16	AC	1,543 ms 113,152 KB
testcase_17	AC	1,692 ms 112,896 KB
testcase_18	AC	1,612 ms 115,072 KB
testcase_19	AC	1,554 ms 112,896 KB
testcase_20	AC	1,546 ms 112,640 KB
testcase_21	AC	1,554 ms 113,108 KB
testcase_22	AC	1,511 ms 113,408 KB
testcase_23	AC	1,542 ms 114,540 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

from collections import deque
import sys
import os
import inspect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

if os.getenv("TKTKLOCAL", False):
    def debug(*arg, sep=" ", end="\n"):
        print(*arg, sep=sep, end=end, file=sys.stderr)

    def debug_indent(*arg, sep=" ", end="\n", indent="    "):
        frame = inspect.currentframe().f_back
        par_func = inspect.getframeinfo(frame).function
        if par_func == "<module>":
            debug(*arg, sep=sep, end=end)
            return

        frame_stack = inspect.stack()
        if len(frame_stack) > 30:
            return

        depth = sum(f.function == par_func for f in frame_stack)
        debug(indent * (depth - 1), end="")
        debug(*arg, sep=sep, end=end)
else:
    def debug(*arg, **kwarg):
        pass

    def debug_indent(*arg, **kwarg):
        pass


class SegTree(object):
    def __init__(self, N, op_data, u_data):
        self._n = N
        self.log = (N-1).bit_length()
        self.size = 1 << self.log

        self.op = op_data
        self.e = u_data

        self.data = [u_data] * (2 * self.size)
        self.len = [1] * (2 * self.size)

    def __repr__(self):
        res = [self.get(i) for i in range(self._n)]
        return " ".join(map(str, res))

    def _update(self, i):
        self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1])

    def initialize(self, arr=None):
        """ segtreeをarrで初期化する。len(arr) == Nにすること """
        if arr:
            for i, a in enumerate(arr, self.size):
                self.data[i] = a
        for i in reversed(range(1, self.size)):
            self._update(i)
            self.len[i] = self.len[i << 1] + self.len[i << 1 | 1]

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        self.data[p] = x
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def get(self, p):
        """ data[p]を返す """
        return self.data[p + self.size]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        """
        sml = self.e
        smr = self.e
        l += self.size
        r += self.size

        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        """ op(data[0], data[1], ... data[N-1])を返す """
        return self.data[1]

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[l])):
                while l < self.size:
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0


class LazySegTree(SegTree):
    def __init__(self, N, op_data, u_data, op_lazy, u_lazy, op_merge):
        super().__init__(N, op_data, u_data)
        self.composition = op_lazy
        self.mapping = op_merge
        self.id = u_lazy

        self.lazy = [u_lazy] * self.size

    def _all_apply(self, i, F):
        self.data[i] = self.mapping(F, self.data[i], self.len[i])
        # self.data[i] = self.mapping(F, self.data[i])
        if i < self.size:
            self.lazy[i] = self.composition(F, self.lazy[i])

    def _push(self, i):
        self._all_apply(i << 1, self.lazy[i])
        self._all_apply(i << 1 | 1, self.lazy[i])
        self.lazy[i] = self.id

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        self.data[p] = x
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def apply(self, p, F):
        """ data[p]にFを作用させる(data[p] = op_merge(F, data[p])とする, 0-indexed) """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        self.data[p] = self.mapping(F, self.data[p], self.len[p])
        # self.data[p] = self.mapping(F, self.data[p])
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def range_apply(self, l, r, F):
        """ i = l, l+1, ..., r-1 について、Fを作用させる(op_merge(F, data[i]), 0-indexed) """
        if l == r:
            return

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):  # too->down
            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 get(self, p):
        """ data[p]を返す """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(p >> i)
        return self.data[p]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        l == rの時は単位元u_dataを返す
        """
        if l == r:
            return self.e

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            if ((l >> i) << i) != l:
                self._push(l >> i)
            if ((r >> i) << i) != r:
                self._push(r >> i)

        sml = self.e
        smr = self.e
        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push(l >> i)

        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[[l]])):
                while l < self.size:
                    self._push(l)
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            self._push((r - 1) >> i)
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    self._push(r)
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0
    """
    遅延セグ木(ac-library移植)
    op_data(d_L, d_R) : d_Lとd_Rの二項演算, dataを返す
    op_lazy(lz_new, lz_orig) : lz_origにlz_newを作用させる, lazyを返す
    op_merge(lz, d) : dにlzを作用させる, dataを返す
    """


u_data = 0
u_lazy = -1


def op(l, r):
    return l + r


def composition(nw, od):
    if nw != -1:
        return nw
    return od


def mapping(lz, d, size):
    if lz != -1:
        return lz * size
    return d


def main():
    N = int(input())
    G = [[] for _ in range(N)]
    for _ in range(N-1):
        a, b = map(int, input().split())
        G[a].append(b)
        G[b].append(a)
    A = list(map(int, input().split()))

    cL = [-1] * N
    cR = [-1] * N
    par = [-1] * N
    loc = [-1] * N
    loc[0] = 0

    val = [A[0]]
    que = deque([0])
    while que:
        s = que.popleft()
        cL[s] = len(val)
        for t in G[s]:
            if t == par[s]:
                continue
            par[t] = s
            loc[t] = len(val)
            val.append(A[t])
            que.append(t)
        cR[s] = len(val)

    ccL = [N] * N
    ccR = [-1] * N
    for i in range(N):
        for j in G[i]:
            if j == par[i]:
                continue
            ccL[i] = min(ccL[i], cL[j])
            ccR[i] = max(ccR[i], cR[j])

    debug(val)
    debug(cL)
    debug(cR)
    debug()
    debug(ccL)
    debug(ccR)
    debug()
    debug(loc)

    seg = LazySegTree(N, op, u_data, composition, u_lazy, mapping)
    seg.initialize(val)

    Q = int(input())
    for _ in range(Q):
        x = int(input())

        # itself
        answer = seg.get(loc[x])
        seg.update(loc[x], 0)

        # child
        answer += seg.prod(cL[x], cR[x])
        seg.range_apply(cL[x], cR[x], 0)

        # mago
        if ccL[x] < ccR[x]:
            answer += seg.prod(ccL[x], ccR[x])
            seg.range_apply(ccL[x], ccR[x], 0)

        if par[x] != -1:  # parent
            p = par[x]
            answer += seg.get(loc[p])
            seg.update(loc[p], 0)
            answer += seg.prod(cL[p], cR[p])
            seg.range_apply(cL[p], cR[p], 0)
            if par[p] != -1:  # grandparent
                pp = par[p]
                answer += seg.get(loc[pp])
                seg.update(loc[pp], 0)

        print(answer)
        seg.update(loc[x], answer)


main()

yukicoder

結果

テストケース

ソースコード