結果

問題 No.1788 Same Set
ユーザー 👑 tute7627tute7627
提出日時 2021-12-02 21:53:00
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,089 ms / 4,000 ms
コード長 8,067 bytes
コンパイル時間 423 ms
コンパイル使用メモリ 82,416 KB
実行使用メモリ 187,068 KB
最終ジャッジ日時 2024-09-13 23:23:16
合計ジャッジ時間 58,218 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
74,976 KB
testcase_01 AC 66 ms
75,056 KB
testcase_02 AC 67 ms
75,888 KB
testcase_03 AC 67 ms
75,352 KB
testcase_04 AC 70 ms
76,972 KB
testcase_05 AC 68 ms
75,852 KB
testcase_06 AC 161 ms
85,700 KB
testcase_07 AC 149 ms
85,532 KB
testcase_08 AC 149 ms
85,292 KB
testcase_09 AC 67 ms
74,764 KB
testcase_10 AC 67 ms
75,232 KB
testcase_11 AC 194 ms
155,556 KB
testcase_12 AC 1,028 ms
155,524 KB
testcase_13 AC 1,278 ms
155,724 KB
testcase_14 AC 1,882 ms
155,904 KB
testcase_15 AC 2,037 ms
150,928 KB
testcase_16 AC 2,486 ms
151,748 KB
testcase_17 AC 1,815 ms
153,916 KB
testcase_18 AC 2,625 ms
169,316 KB
testcase_19 AC 988 ms
154,596 KB
testcase_20 AC 279 ms
154,600 KB
testcase_21 AC 2,118 ms
154,172 KB
testcase_22 AC 2,397 ms
154,676 KB
testcase_23 AC 1,759 ms
153,796 KB
testcase_24 AC 2,002 ms
154,180 KB
testcase_25 AC 2,943 ms
167,720 KB
testcase_26 AC 2,657 ms
163,388 KB
testcase_27 AC 211 ms
153,916 KB
testcase_28 AC 3,089 ms
187,068 KB
testcase_29 AC 2,584 ms
160,188 KB
testcase_30 AC 264 ms
153,916 KB
testcase_31 AC 2,737 ms
168,112 KB
testcase_32 AC 2,194 ms
153,900 KB
testcase_33 AC 2,374 ms
154,000 KB
testcase_34 AC 2,596 ms
170,048 KB
testcase_35 AC 2,698 ms
170,944 KB
testcase_36 AC 2,597 ms
169,920 KB
testcase_37 AC 2,680 ms
170,816 KB
testcase_38 AC 2,557 ms
164,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import types

_atcoder_code = """
# Python port of AtCoder Library.

__version__ = '0.0.1'
"""

atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)

_atcoder__bit_code = """
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
"""

atcoder._bit = types.ModuleType('atcoder._bit')
exec(_atcoder__bit_code, atcoder._bit.__dict__)


_atcoder_lazysegtree_code = """
import typing

# import atcoder._bit


class LazySegTree:
    def __init__(
            self,
            op: typing.Callable[[typing.Any, typing.Any], typing.Any],
            e: typing.Any,
            mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],
            composition: typing.Callable[[typing.Any, typing.Any], typing.Any],
            id_: typing.Any,
            v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = id_

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = atcoder._bit._ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)
        self._lz = [self._id] * 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
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        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

        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        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 apply(self, left: int, right: typing.Optional[int] = None,
              f: typing.Optional[typing.Any] = None) -> None:
        assert f is not None

        if right is None:
            p = left
            assert 0 <= left < self._n

            p += self._size
            for i in range(self._log, 0, -1):
                self._push(p >> i)
            self._d[p] = self._mapping(f, self._d[p])
            for i in range(1, self._log + 1):
                self._update(p >> i)
        else:
            assert 0 <= left <= right <= self._n
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right - 1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log + 1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right - 1) >> i)

    def max_right(
            self, left: int, g: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert g(self._e)

        if left == self._n:
            return self._n

        left += self._size
        for i in range(self._log, 0, -1):
            self._push(left >> i)

        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not g(self._op(sm, self._d[left])):
                while left < self._size:
                    self._push(left)
                    left *= 2
                    if g(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, g: typing.Any) -> int:
        assert 0 <= right <= self._n
        assert g(self._e)

        if right == 0:
            return 0

        right += self._size
        for i in range(self._log, 0, -1):
            self._push((right - 1) >> i)

        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 g(self._op(self._d[right], sm)):
                while right < self._size:
                    self._push(right)
                    right = 2 * right + 1
                    if g(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 _all_apply(self, k: int, f: typing.Any) -> None:
        self._d[k] = self._mapping(f, self._d[k])
        if k < self._size:
            self._lz[k] = self._composition(f, self._lz[k])

    def _push(self, k: int) -> None:
        self._all_apply(2 * k, self._lz[k])
        self._all_apply(2 * k + 1, self._lz[k])
        self._lz[k] = self._id
"""

atcoder.lazysegtree = types.ModuleType('atcoder.lazysegtree')
atcoder.lazysegtree.__dict__['atcoder'] = atcoder
atcoder.lazysegtree.__dict__['atcoder._bit'] = atcoder._bit
exec(_atcoder_lazysegtree_code, atcoder.lazysegtree.__dict__)
LazySegTree = atcoder.lazysegtree.LazySegTree

from typing import Tuple
# from atcoder.lazysegtree import LazySegTree


def op(l: Tuple[int, int], r: Tuple[int, int]) -> Tuple[int, int]:
  if l[0] == r[0]:
    return l[0], l[1] + r[1]
  if l[0] < r[0]:
    return l
  else:
    return r

e = 998244353, 0

def mapping(l: int, r: Tuple[int, int]) -> Tuple[int, int]:
  return r[0] + l, r[1]

def composition(l: int, r:int) -> int:
  return l + r;

id = 0

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
init = [(0, 1)] * n
init.append((0, 0))
seg = LazySegTree(op, e, mapping, composition, id, init)
sz = 400005;
pre_a = [-1] * sz
pre_b = [-1] * sz;
ans = 0;
for i in range(n):
  upd = [];
  upd.append(a[i]);
  if a[i] != b[i]:
    upd.append(b[i]);
  for val in upd:
    l = min(pre_a[val], pre_b[val]);
    r = max(pre_a[val], pre_b[val]);
    seg.apply(l + 1, r + 1, -1);
  pre_a[a[i]] = i;
  pre_b[b[i]] = i;
  for val in upd:
    l = min(pre_a[val], pre_b[val]);
    r = max(pre_a[val], pre_b[val]);
    seg.apply(l + 1, r + 1, 1);
  ans += seg.all_prod()[1] - (n - i - 1);
print(ans)
0