結果

問題 No.529 帰省ラッシュ
ユーザー mkawa2mkawa2
提出日時 2023-03-15 13:14:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,581 ms / 4,500 ms
コード長 7,030 bytes
コンパイル時間 146 ms
コンパイル使用メモリ 82,088 KB
実行使用メモリ 149,428 KB
最終ジャッジ日時 2024-09-18 08:42:54
合計ジャッジ時間 15,830 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
68,608 KB
testcase_01 AC 67 ms
68,608 KB
testcase_02 AC 70 ms
69,120 KB
testcase_03 AC 70 ms
68,736 KB
testcase_04 AC 204 ms
80,116 KB
testcase_05 AC 214 ms
80,336 KB
testcase_06 AC 189 ms
80,640 KB
testcase_07 AC 193 ms
80,100 KB
testcase_08 AC 1,020 ms
113,736 KB
testcase_09 AC 1,209 ms
115,536 KB
testcase_10 AC 1,340 ms
130,664 KB
testcase_11 AC 1,354 ms
130,532 KB
testcase_12 AC 788 ms
105,428 KB
testcase_13 AC 573 ms
148,632 KB
testcase_14 AC 526 ms
114,176 KB
testcase_15 AC 1,581 ms
135,628 KB
testcase_16 AC 1,510 ms
135,000 KB
testcase_17 AC 1,003 ms
149,272 KB
testcase_18 AC 999 ms
149,428 KB
testcase_19 AC 989 ms
149,256 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
from heapq import heappop, heappush

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])

def heavy_light_decomposition(uu, root=0):
    stack = [root]
    while stack:
        u = stack.pop()
        uu.append(u)
        for v in to[u]:
            depth[v] = depth[u]+1
            # to[v].remove(u)
            parent[v] = u
            stack.append(v)
    size = [1]*n
    for u in uu[:0:-1]: size[parent[u]] += size[u]
    stack = [root]
    uu.clear()
    while stack:
        u = stack.pop()
        uu.append(u)
        if not to[u]: continue
        h = to[u][0]
        for v in to[u][1:]:
            if size[v] > size[h]: h, v = v, h
            stack.append(v)
            top[v] = v
        stack.append(h)
        top[h] = top[u]

def hl_get(u, v):
    res = -1
    while top[u] != top[v]:
        if depth[top[u]] > depth[top[v]]: u, v = v, u
        l, r = gtoi[top[v]], gtoi[v]+1
        res = max(res, seg.prod(l, r))
        v = parent[top[v]]
    if depth[u] > depth[v]: u, v = v, u
    l, r = gtoi[u], gtoi[v]+1
    res = max(res, seg.prod(l, r))
    return res

def dfs(root=0):
    uu = [root]
    lowlink[root] = 0
    dfsOrder[root] = 0
    stack = [(-1, root)]+[(u, root) for u in to[root]]
    while stack:
        u, p = stack.pop()
        if u >= 0 and dfsOrder[u] == -1:
            parent[u] = p
            depth[u] = depth[p]+1
            dfsOrder[u] = len(uu)
            lowlink[u] = len(uu)
            uu.append(u)
            stack.append((-1, u))
            to_par = False
            for v in to[u]:
                if v != p or to_par: stack.append((v, u))
                if v == p: to_par = True
        elif u == -1:
            if p != root: lowlink[parent[p]] = min(lowlink[parent[p]], lowlink[p])
        else:
            lowlink[p] = min(lowlink[p], dfsOrder[u])

    return uu

n, m, q = LI()
to = [[] for _ in range(n)]
for _ in range(m):
    u, v = LI1()
    to[u].append(v)
    to[v].append(u)

lowlink = [n]*n
parent, depth, dfsOrder = [-1]*n, [0]*n, [-1]*n
uu = dfs()
# pDB("par", parent)
# pDB("dep", depth)
# pDB("ord", dfsOrder)
# pDB("low", lowlink)

utog = [0]*n
to = [[]]
for u in uu[1:]:
    p = parent[u]
    if dfsOrder[p] < lowlink[u]:
        utog[u] = len(to)
        to.append([])
        to[utog[p]].append(utog[u])
    else:
        utog[u] = utog[p]
# pDB(utog)
# pDB(to)

gn = len(to)
gg, depth, parent, top = [], [0]*gn, [-1]*gn, [0]*gn
heavy_light_decomposition(gg)
gtoi = {u: i for i, u in enumerate(gg)}
seg = SegTree(max, -1, gn)

hps = [[] for _ in range(gn)]

for _ in range(q):
    t, u, w = LI()
    if t == 1:
        u -= 1
        g = utog[u]
        if not hps[g] or w > -hps[g][0]:
            i = gtoi[g]
            seg.set(i, w << 20 | g)
        heappush(hps[g], -w)
    else:
        g, h = utog[u-1], utog[w-1]
        wg = hl_get(g, h)
        if wg == -1:
            print(-1)
            continue
        w, g = divmod(wg, 1 << 20)
        print(w)
        heappop(hps[g])
        wg = -1
        if hps[g]: wg = (-hps[g][0]) << 20 | g
        i = gtoi[g]
        seg.set(i, wg)
0