結果

問題 No.1804 Intersection of LIS
ユーザー noriocnorioc
提出日時 2024-05-19 18:13:03
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,647 bytes
コンパイル時間 239 ms
コンパイル使用メモリ 82,352 KB
実行使用メモリ 240,808 KB
最終ジャッジ日時 2024-05-19 18:13:22
合計ジャッジ時間 15,308 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
68,708 KB
testcase_01 AC 56 ms
67,492 KB
testcase_02 AC 59 ms
68,060 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 55 ms
67,284 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 56 ms
67,348 KB
testcase_34 WA -
testcase_35 AC 669 ms
240,808 KB
testcase_36 AC 647 ms
240,556 KB
testcase_37 AC 211 ms
180,720 KB
testcase_38 AC 233 ms
180,780 KB
testcase_39 AC 58 ms
67,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict
from bisect import bisect_left
import typing


def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


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 solve(a: list) -> list:
    # LIS のアルゴリズム
    n = len(a)
    ranks = [0] * n  # ranks[i] : A[i] が LIS の何番目か
    dp = [INF] * n
    for i in range(n):
        ranks[i] = bisect_left(dp, a[i])
        dp[ranks[i]] = a[i]

    max_rank = max(ranks)
    d = defaultdict(set)
    for i in range(n):
        d[ranks[i]].add(i)

    res = []
    lasts = [a[i] for i in range(n) if ranks[i] == max_rank]
    if len(lasts) == 1:
        res.append(lasts[0])

    segt = SegTree(max, 0, n+1)
    for rank in range(max_rank):
        # 次のランクの要素
        for i in d[rank+1]:
            segt.set(i, a[i])

        cands = []
        for i in list(d[rank]):
            x = segt.prod(i+1, n)  # i より右側に a[i] より大きい値が存在するか
            if x <= a[i]:
                d[rank].discard(i)
            else:
                cands.append(a[i])

        if len(cands) == 1:
            res.append(cands[0])

        # 戻す
        for i in d[rank+1]:
            segt.set(i, 0)

    return sorted(res)


INF = 1 << 60
N = int(input())
P = list(map(int, input().split()))

res = solve(P)
print(len(res))
print(*res)
0