結果

問題 No.650 行列木クエリ
ユーザー mkawa2mkawa2
提出日時 2023-03-06 12:53:54
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 6,131 bytes
コンパイル時間 189 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 163,644 KB
最終ジャッジ日時 2024-09-18 01:49:31
合計ジャッジ時間 8,815 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
68,864 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 65 ms
68,608 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 69 ms
68,480 KB
testcase_07 AC 66 ms
68,352 KB
testcase_08 AC 842 ms
113,960 KB
testcase_09 AC 1,196 ms
159,700 KB
testcase_10 AC 65 ms
67,840 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])

def heavy_light_decomposition(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 update(e, val):
    u, v = uv[e]
    if depth[u] > depth[v]: u, v = v, u
    i = utoi[v]
    st.set(i, val)
    return

def get(u, v):
    res = seg_e
    while top[u] != top[v]:
        if depth[top[u]] > depth[top[v]]: u, v = v, u
        l, r = utoi[top[v]], utoi[v]+1
        res = dot(res, st.prod(l, r))
        v = parent[top[v]]
    if depth[u] > depth[v]: u, v = v, u
    l, r = utoi[u], utoi[v]+1
    # prod(l,r) !caution! case of edge...(l+1,r,val)
    if l+1 < r: res = dot(st.prod(l+1, r),res)
    return res

def dot(aa, bb):
    h = len(aa)
    w = len(bb[0])
    res = [[0]*w for _ in range(h)]
    for i, row in enumerate(aa):
        for j, col in enumerate(zip(*bb)):
            v = 0
            # for a, b in zip(row, col): v += a*b
            for a, b in zip(row, col): v = (v+a*b)%md
            res[i][j] = v
        res[i] = tuple(res[i])
    return tuple(res)

n = II()
to = [[] for _ in range(n)]
uv = []
for e in range(n-1):
    u, v = LI()
    to[u].append(v)
    to[v].append(u)
    uv.append((u, v))

uu, depth, parent, top = [], [0]*n, [-1]*n, [0]*n
heavy_light_decomposition()
utoi = {u: i for i, u in enumerate(uu)}

seg_e = ((1, 0), (0, 1))

st = SegTree(dot, seg_e, n)
for _ in range(II()):
    t, *xx = SI().split()
    xx = list(map(int, xx))
    if t == "x":
        e = xx[0]
        mat = ((xx[1], xx[2]), (xx[3], xx[4]))
        update(e, mat)
    else:
        u, v = xx
        mat = get(u, v)
        print(*mat[0], *mat[1])
0