結果

問題 No.1788 Same Set
ユーザー mkawa2mkawa2
提出日時 2023-10-15 16:45:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,009 ms / 4,000 ms
コード長 6,681 bytes
コンパイル時間 469 ms
コンパイル使用メモリ 87,068 KB
実行使用メモリ 189,308 KB
最終ジャッジ日時 2023-10-15 16:47:04
合計ジャッジ時間 63,976 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 94 ms
72,204 KB
testcase_01 AC 94 ms
72,500 KB
testcase_02 AC 96 ms
72,548 KB
testcase_03 AC 95 ms
72,380 KB
testcase_04 AC 93 ms
72,024 KB
testcase_05 AC 94 ms
72,304 KB
testcase_06 AC 214 ms
79,620 KB
testcase_07 AC 215 ms
79,192 KB
testcase_08 AC 185 ms
78,964 KB
testcase_09 AC 93 ms
72,168 KB
testcase_10 AC 92 ms
72,300 KB
testcase_11 AC 774 ms
140,212 KB
testcase_12 AC 1,109 ms
139,972 KB
testcase_13 AC 1,231 ms
140,240 KB
testcase_14 AC 1,476 ms
140,104 KB
testcase_15 AC 1,827 ms
140,576 KB
testcase_16 AC 2,270 ms
126,196 KB
testcase_17 AC 2,432 ms
173,472 KB
testcase_18 AC 2,486 ms
140,500 KB
testcase_19 AC 1,015 ms
189,308 KB
testcase_20 AC 1,123 ms
118,992 KB
testcase_21 AC 1,865 ms
119,672 KB
testcase_22 AC 2,028 ms
119,132 KB
testcase_23 AC 2,235 ms
120,220 KB
testcase_24 AC 2,158 ms
119,644 KB
testcase_25 AC 2,458 ms
119,912 KB
testcase_26 AC 2,320 ms
119,628 KB
testcase_27 AC 1,240 ms
119,636 KB
testcase_28 AC 2,924 ms
127,980 KB
testcase_29 AC 2,112 ms
119,776 KB
testcase_30 AC 1,358 ms
119,768 KB
testcase_31 AC 2,296 ms
119,920 KB
testcase_32 AC 1,897 ms
132,144 KB
testcase_33 AC 2,642 ms
140,476 KB
testcase_34 AC 2,719 ms
138,872 KB
testcase_35 AC 2,479 ms
137,104 KB
testcase_36 AC 2,831 ms
146,704 KB
testcase_37 AC 2,750 ms
142,788 KB
testcase_38 AC 3,009 ms
151,656 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

M = (1 << 20)-1
# treeのマージ
def op(x, y):
    if x >> 20 == y >> 20: return x+(y & M)
    return min(x, y)

# treeの単位元
e = 1 << 41

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

# 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 = pos[a]
    if l > r: l, r = r, l
    if l < r: seg.apply(l+1, r+1, -1)

    pos[a][i] = j
    l, r = pos[a]
    if l > r: l, r = r, l
    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)
    if ret >> 20 == 0: ans += ret & M

print(ans)
0