結果

問題 No.1788 Same Set
ユーザー mkawa2mkawa2
提出日時 2021-12-19 13:42:08
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,845 bytes
コンパイル時間 831 ms
コンパイル使用メモリ 86,668 KB
実行使用メモリ 216,216 KB
最終ジャッジ日時 2023-10-13 18:41:04
合計ジャッジ時間 92,183 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
72,228 KB
testcase_01 AC 94 ms
72,200 KB
testcase_02 AC 97 ms
72,176 KB
testcase_03 AC 98 ms
71,928 KB
testcase_04 AC 97 ms
72,228 KB
testcase_05 AC 97 ms
72,092 KB
testcase_06 AC 236 ms
79,576 KB
testcase_07 AC 213 ms
79,044 KB
testcase_08 AC 202 ms
79,480 KB
testcase_09 AC 94 ms
72,156 KB
testcase_10 AC 95 ms
72,120 KB
testcase_11 AC 1,366 ms
140,216 KB
testcase_12 AC 1,797 ms
140,392 KB
testcase_13 AC 1,873 ms
140,504 KB
testcase_14 AC 2,397 ms
140,356 KB
testcase_15 AC 2,580 ms
140,308 KB
testcase_16 AC 3,255 ms
131,668 KB
testcase_17 AC 2,666 ms
209,616 KB
testcase_18 AC 3,590 ms
204,584 KB
testcase_19 AC 1,514 ms
216,216 KB
testcase_20 AC 1,716 ms
123,228 KB
testcase_21 AC 2,754 ms
124,456 KB
testcase_22 AC 3,040 ms
133,652 KB
testcase_23 AC 2,784 ms
130,612 KB
testcase_24 AC 3,511 ms
163,036 KB
testcase_25 AC 3,935 ms
172,072 KB
testcase_26 AC 3,618 ms
164,216 KB
testcase_27 AC 2,300 ms
157,232 KB
testcase_28 TLE -
testcase_29 AC 3,442 ms
172,292 KB
testcase_30 AC 2,420 ms
158,048 KB
testcase_31 AC 3,942 ms
183,664 KB
testcase_32 AC 3,137 ms
175,120 KB
testcase_33 AC 3,452 ms
185,776 KB
testcase_34 AC 3,607 ms
201,852 KB
testcase_35 AC 3,691 ms
205,652 KB
testcase_36 AC 3,624 ms
204,000 KB
testcase_37 AC 3,642 ms
204,500 KB
testcase_38 AC 3,738 ms
199,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = 18446744073709551615
inf = 4294967295
# md = 10**9+7
md = 998244353

class LazySegTree:
    def __init__(self, op, e, mapping, composition, _id, v):
        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 = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._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, x):
        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):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left, right):
        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):
        return self._d[1]

    def apply(self, left, right, f):
        if right is None:
            p = left
            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:
            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, g):
        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, g):
        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):
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

    def _all_apply(self, k, f):
        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):
        self._all_apply(2*k, self._lz[k])
        self._all_apply(2*k+1, self._lz[k])
        self._lz[k] = self._id

# treeのマージ
def op(x, y):
    xv, xc = x >> 32, x%(1 << 32)
    yv, yc = y >> 32, y%(1 << 32)
    if xv == yv:
        v, c = xv, xc+yc
    elif xv < yv:
        v, c = xv, xc
    else:
        v, c = yv, yc
    return v << 32 | c

# treeの単位元
e = inf<<32

# lazy(f)からtree(x)への操作
def mapping(f, x):
    return x+(f << 32)

# lazyの下への分解
def composition(f, g):
    return f+g

# lazyの単位元
_id = 0

from collections import defaultdict

n = II()
aa = LI()
bb = LI()

def update(i, j, a):
    l, r = min(pos[a]), max(pos[a])
    # pDB(l,r)
    if l < r: seg.apply(l+1, r+1, -1)
    pos[a][i] = j
    l, r = min(pos[a]), max(pos[a])
    # pDB(l,r)
    if l < r: seg.apply(l+1, r+1, 1)

seg = LazySegTree(op, e, mapping, composition, _id, [1]*n)
pos = defaultdict(lambda: [-1, -1])
ans = 0
for j, (a, b) in enumerate(zip(aa, bb)):
    update(0, j, a)
    update(1, j, b)
    ret = seg.prod(0, j+1)
    mn, cnt = ret >> 32, ret%(1 << 32)
    # pDB(mn,cnt)
    if mn == 0: ans += cnt

print(ans)
0