結果

問題 No.1494 LCS on Tree
ユーザー 草苺奶昔草苺奶昔
提出日時 2023-03-14 10:10:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 715 ms / 2,000 ms
コード長 3,411 bytes
コンパイル時間 333 ms
コンパイル使用メモリ 82,368 KB
実行使用メモリ 295,952 KB
最終ジャッジ日時 2024-04-30 17:53:01
合計ジャッジ時間 22,113 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
69,012 KB
testcase_01 AC 71 ms
69,264 KB
testcase_02 AC 69 ms
69,760 KB
testcase_03 AC 665 ms
259,212 KB
testcase_04 AC 613 ms
269,760 KB
testcase_05 AC 628 ms
269,876 KB
testcase_06 AC 613 ms
269,520 KB
testcase_07 AC 601 ms
259,912 KB
testcase_08 AC 622 ms
269,784 KB
testcase_09 AC 622 ms
259,356 KB
testcase_10 AC 631 ms
269,812 KB
testcase_11 AC 643 ms
258,640 KB
testcase_12 AC 612 ms
270,004 KB
testcase_13 AC 617 ms
270,172 KB
testcase_14 AC 696 ms
268,616 KB
testcase_15 AC 643 ms
269,984 KB
testcase_16 AC 626 ms
269,252 KB
testcase_17 AC 626 ms
270,020 KB
testcase_18 AC 645 ms
269,668 KB
testcase_19 AC 66 ms
69,448 KB
testcase_20 AC 66 ms
68,752 KB
testcase_21 AC 67 ms
69,512 KB
testcase_22 AC 65 ms
68,308 KB
testcase_23 AC 65 ms
68,592 KB
testcase_24 AC 66 ms
69,328 KB
testcase_25 AC 66 ms
68,556 KB
testcase_26 AC 65 ms
68,572 KB
testcase_27 AC 68 ms
68,656 KB
testcase_28 AC 66 ms
68,600 KB
testcase_29 AC 67 ms
68,652 KB
testcase_30 AC 657 ms
269,340 KB
testcase_31 AC 651 ms
269,468 KB
testcase_32 AC 627 ms
258,632 KB
testcase_33 AC 629 ms
259,816 KB
testcase_34 AC 653 ms
269,188 KB
testcase_35 AC 119 ms
85,168 KB
testcase_36 AC 315 ms
124,700 KB
testcase_37 AC 106 ms
81,428 KB
testcase_38 AC 199 ms
118,680 KB
testcase_39 AC 369 ms
160,800 KB
testcase_40 AC 164 ms
94,792 KB
testcase_41 AC 487 ms
215,496 KB
testcase_42 AC 149 ms
94,520 KB
testcase_43 AC 460 ms
190,708 KB
testcase_44 AC 380 ms
158,932 KB
testcase_45 AC 715 ms
295,940 KB
testcase_46 AC 661 ms
295,680 KB
testcase_47 AC 664 ms
295,952 KB
testcase_48 AC 694 ms
295,532 KB
testcase_49 AC 653 ms
295,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict
from typing import List, Tuple
from typing import Callable, Generic, List, TypeVar

T = TypeVar("T")


class Rerooting(Generic[T]):

    __slots__ = ("adjList", "_n", "_decrement")

    def __init__(self, n: int, decrement: int = 0):
        self.adjList = [[] for _ in range(n)]
        self._n = n
        self._decrement = decrement

    def addEdge(self, u: int, v: int) -> None:
        u -= self._decrement
        v -= self._decrement
        self.adjList[u].append(v)
        self.adjList[v].append(u)

    def rerooting(
        self,
        e: Callable[[int], T],
        op: Callable[[T, T], T],
        composition: Callable[[T, int, int, int], T],
        root=0,
    ) -> List["T"]:
        root -= self._decrement
        assert 0 <= root < self._n
        parents = [-1] * self._n
        order = [root]
        stack = [root]
        while stack:
            cur = stack.pop()
            for next in self.adjList[cur]:
                if next == parents[cur]:
                    continue
                parents[next] = cur
                order.append(next)
                stack.append(next)

        dp1 = [e(i) for i in range(self._n)]
        dp2 = [e(i) for i in range(self._n)]
        for cur in order[::-1]:
            res = e(cur)
            for next in self.adjList[cur]:
                if parents[cur] == next:
                    continue
                dp2[next] = res
                res = op(res, composition(dp1[next], cur, next, 0))
            res = e(cur)
            for next in self.adjList[cur][::-1]:
                if parents[cur] == next:
                    continue
                dp2[next] = op(res, dp2[next])
                res = op(res, composition(dp1[next], cur, next, 0))
            dp1[cur] = res

        for newRoot in order[1:]:
            parent = parents[newRoot]
            dp2[newRoot] = composition(op(dp2[newRoot], dp2[parent]), parent, newRoot, 1)
            dp1[newRoot] = op(dp1[newRoot], dp2[newRoot])
        return dp1



def lcsOnTree(n: int, edges: List[Tuple[int, int, str]], target: str) -> int:
    def e(root: int) -> List[int]:
        return [0] * (len(target) + 1)

    def op(childRes1: List[int], childRes2: List[int]) -> List[int]:
        res = childRes1[:]
        for i in range(len(res)):
            res[i] = max(res[i], childRes2[i])
        return res

    def composition(fromRes: List[int], parent: int, cur: int, direction: int) -> List[int]:
        """direction: 0: cur -> parent, 1: parent -> cur"""
        from_, to = (cur, parent) if direction == 0 else (parent, cur)
        c = weights[from_][to]
        res = fromRes[:]
        for i in range(len(s) - 1, -1, -1):
            if s[i] == c:
                res[i + 1] = max(res[i + 1], res[i] + 1)
        for i in range(len(s)):
            res[i + 1] = max(res[i + 1], res[i])
        return res

    R = Rerooting[List[int]](n)
    weights = [defaultdict(str) for _ in range(n)]
    for u, v, c in edges:
        R.addEdge(u, v)
        weights[u][v] = c
        weights[v][u] = c

    dp = R.rerooting(e=e, op=op, composition=composition, root=0)
    return max(v[-1] for v in dp)


if __name__ == "__main__":
    n = int(input())
    s = input()
    edges = []
    for _ in range(n - 1):
        u, v, c = input().split()
        edges.append((int(u) - 1, int(v) - 1, c))

    print(lcsOnTree(n, edges, s))
0