結果

問題 No.2759 Take Pictures, Elements?
ユーザー ntudantuda
提出日時 2024-05-18 13:12:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 373 ms / 2,000 ms
コード長 4,252 bytes
コンパイル時間 229 ms
コンパイル使用メモリ 82,500 KB
実行使用メモリ 82,720 KB
最終ジャッジ日時 2024-05-18 13:12:42
合計ジャッジ時間 5,093 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 273 ms
80,940 KB
testcase_01 AC 373 ms
82,720 KB
testcase_02 AC 65 ms
67,712 KB
testcase_03 AC 82 ms
67,968 KB
testcase_04 AC 64 ms
67,840 KB
testcase_05 AC 61 ms
67,968 KB
testcase_06 AC 64 ms
68,096 KB
testcase_07 AC 62 ms
68,736 KB
testcase_08 AC 63 ms
68,352 KB
testcase_09 AC 136 ms
78,976 KB
testcase_10 AC 144 ms
79,016 KB
testcase_11 AC 139 ms
78,976 KB
testcase_12 AC 141 ms
78,848 KB
testcase_13 AC 138 ms
79,332 KB
testcase_14 AC 212 ms
80,392 KB
testcase_15 AC 195 ms
80,640 KB
testcase_16 AC 192 ms
80,660 KB
testcase_17 AC 193 ms
80,628 KB
testcase_18 AC 194 ms
80,444 KB
testcase_19 AC 188 ms
80,640 KB
testcase_20 AC 208 ms
80,808 KB
testcase_21 AC 63 ms
67,840 KB
testcase_22 AC 64 ms
68,096 KB
testcase_23 AC 66 ms
67,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

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

    return x

def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

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

N, Q = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
from collections import defaultdict

dic = defaultdict(list)
for i, a in enumerate(A):
    dic[a].append(i)
INF = 10 ** 6

base = [INF] * N
ST1a = SegTree(min, INF, base)
ST2a = SegTree(min, INF, base)
ST1a.set(0, 0)
ST2a.set(0, 0)

for b in B:
    ST1b = SegTree(min, INF, base)
    ST2b = SegTree(min, INF, base)
    BB = [-1] * N
    for c in dic[b]:
        a = ST1a.prod(c, N) - c
        a = min(a, ST2a.prod(0, c) + c)
        #BB[c] = a
        ST1b.set(c, a + c)
        ST2b.set(c, a - c)
    #print(BB)
    ST1a = ST1b
    ST2a = ST2b

ans = INF
for i in range(N):
    ans = min(ans, ST1a.get(i) - i, ST2a.get(i) + i)
print(ans)
0