#1171964 (PyPy3) No.3782 Synchronized Subsequences

• 問題: No.3782 Synchronized Subsequences
• ユーザー: askr58
• 提出日時: 2026-07-18 20:37:28
• 言語: PyPy3 (8.0.0 + ACL)
• 結果: AC
• 実行時間: 2,071 ms / 3,000 ms
• コード長: 4,703 bytes
• コンパイル時間: 102 ms
• コンパイル使用メモリ: 64,604 KB
• 実行使用メモリ: 104,928 KB
• 最終ジャッジ日時: 2026-10-30 20:51:00
• 合計ジャッジ時間: 45,920 ms
• ジャッジサーバーID （参考情報）: judge7_0 / judge4_0

ファイルパターン	結果
sample	AC * 1
other	AC * 40

ソースコード

import sys
import typing


# ac-library-python: atcoder/_bit.py
def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


# ac-library-python: atcoder/segtree.py
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 = _ceil_pow2(self._n)
        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 op(x: int, y: int) -> int:
    return max(x, y)


def main() -> None:
    input = sys.stdin.buffer.readline

    ttt = int(input())

    for _ in range(ttt):
        n = int(input())

        p = list(map(int, input().split()))
        q = list(map(int, input().split()))

        for i in range(n):
            p[i] -= 1

        for i in range(n):
            q[i] -= 1

        segs = [SegTree(op, 0, n) for _ in range(n)]

        for i in range(n):
            segl = SegTree(op, 0, n)
            segh = SegTree(op, 0, n)
            res = [0] * n

            for j in range(n):
                res[j] = max(
                    segl.prod(0, q[j]),
                    segh.prod(q[j] + 1, n),
                ) + 1

                segl.set(
                    q[j],
                    segs[j].prod(0, p[i]),
                )
                segh.set(
                    q[j],
                    segs[j].prod(p[i] + 1, n),
                )

            for j in range(n):
                segs[j].set(p[i], res[j])

        ans = 0

        for i in range(n):
            ans = max(ans, segs[i].all_prod())

        print(ans)


if __name__ == "__main__":
    main()