結果

問題 No.1030 だんしんぐぱーりない
ユーザー mkawa2mkawa2
提出日時 2022-05-26 18:57:14
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,063 ms / 2,000 ms
コード長 6,207 bytes
コンパイル時間 749 ms
コンパイル使用メモリ 81,724 KB
実行使用メモリ 135,144 KB
最終ジャッジ日時 2023-10-20 19:32:02
合計ジャッジ時間 32,767 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 61 ms
67,912 KB
testcase_01 AC 61 ms
67,912 KB
testcase_02 AC 61 ms
67,912 KB
testcase_03 AC 60 ms
67,912 KB
testcase_04 AC 61 ms
67,908 KB
testcase_05 AC 757 ms
119,072 KB
testcase_06 AC 888 ms
114,844 KB
testcase_07 AC 549 ms
99,584 KB
testcase_08 AC 550 ms
102,316 KB
testcase_09 AC 642 ms
121,904 KB
testcase_10 AC 486 ms
90,964 KB
testcase_11 AC 678 ms
107,968 KB
testcase_12 AC 603 ms
115,056 KB
testcase_13 AC 593 ms
110,780 KB
testcase_14 AC 719 ms
116,740 KB
testcase_15 AC 492 ms
97,196 KB
testcase_16 AC 625 ms
106,312 KB
testcase_17 AC 649 ms
123,876 KB
testcase_18 AC 794 ms
118,080 KB
testcase_19 AC 573 ms
94,640 KB
testcase_20 AC 599 ms
100,096 KB
testcase_21 AC 615 ms
111,468 KB
testcase_22 AC 594 ms
104,112 KB
testcase_23 AC 652 ms
102,156 KB
testcase_24 AC 616 ms
102,040 KB
testcase_25 AC 642 ms
105,560 KB
testcase_26 AC 548 ms
90,180 KB
testcase_27 AC 547 ms
95,712 KB
testcase_28 AC 681 ms
111,676 KB
testcase_29 AC 561 ms
113,616 KB
testcase_30 AC 544 ms
103,916 KB
testcase_31 AC 558 ms
100,284 KB
testcase_32 AC 638 ms
116,360 KB
testcase_33 AC 661 ms
123,128 KB
testcase_34 AC 719 ms
94,044 KB
testcase_35 AC 907 ms
135,144 KB
testcase_36 AC 1,063 ms
134,424 KB
testcase_37 AC 816 ms
130,244 KB
testcase_38 AC 833 ms
129,356 KB
testcase_39 AC 811 ms
129,204 KB
testcase_40 AC 63 ms
68,072 KB
testcase_41 AC 60 ms
68,072 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 = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

import typing

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        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 = [e]*(2*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: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log+1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p+self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        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) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(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: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        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 f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2*right+1
                    if f(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: int) -> None:
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

class LCA:
    # 頂点は0～n-1
    def __init__(self, parents, depth):
        self.n = len(parents)
        self.parents = parents
        self.depth = depth
        self.max_level = max(self.depth).bit_length()
        self.ancestor = [self.parents]+[[-1]*self.n for _ in range(self.max_level)]
        row0 = self.ancestor[0]
        for lv in range(self.max_level):
            row1 = self.ancestor[lv+1]
            for u in range(self.n):
                row1[u] = row0[row0[u]]
            row0 = row1

    # 最小共通祖先
    def anc(self, u, v):
        diff = self.depth[u]-self.depth[v]
        if diff < 0: u, v = v, u
        diff = abs(diff)
        lv = 0
        while diff:
            if diff & 1: u = self.ancestor[lv][u]
            lv, diff = lv+1, diff >> 1
        if u == v: return u
        for lv in range(self.depth[u].bit_length()-1, -1, -1):
            anclv = self.ancestor[lv]
            if anclv[u] != anclv[v]: u, v = anclv[u], anclv[v]
        return self.parents[u]

n, k, q = LI()
cc = LI()
aa = LI1()
to = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = LI1()
    to[u].append(v)
    to[v].append(u)

parent, depth, vis = [-1]*n, [0]*n, [0]*n

def dfs(root):
    uu = []
    vis[root] = 1
    stack = [root]
    while stack:
        iu = stack.pop()
        i, u = divmod(iu, n)
        if i == 0:
            uu.append(u)
        # care to's format
        while i < len(to[u]) and vis[to[u][i]]: i += 1
        if i == len(to[u]):
            pass
        else:
            stack.append((i+1)*n+u)
            # care to's format
            v = to[u][i]
            vis[v] = 1
            stack.append(v)
            parent[v] = u
            depth[v] = depth[u]+1
            cc[v] = max(cc[v], cc[u])

    return uu

e = (inf, -inf)
def op(a, b):
    return (min(a[0], b[0]), max(a[1], b[1]))

uu = dfs(0)
utoi = {u: i for i, u in enumerate(uu)}
st = SegTree(op, e, [(utoi[a], utoi[a]) for a in aa])
lca = LCA(parent, depth)

for _ in range(q):
    t, x, y = LI1()
    if t:
        i, j = st.prod(x, y+1)
        u = uu[i]
        v = uu[j]
        a = lca.anc(u, v)
        print(cc[a])
    else:
        i = utoi[y]
        st.set(x, (i, i))
0