結果

問題 No.469 区間加算と一致検索の問題
ユーザー mkawa2mkawa2
提出日時 2024-10-12 01:23:46
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,203 ms / 5,000 ms
コード長 6,808 bytes
コンパイル時間 255 ms
コンパイル使用メモリ 82,436 KB
実行使用メモリ 223,256 KB
最終ジャッジ日時 2024-10-12 01:24:31
合計ジャッジ時間 39,000 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 309 ms
183,520 KB
testcase_01 AC 284 ms
171,700 KB
testcase_02 AC 293 ms
185,440 KB
testcase_03 AC 479 ms
184,776 KB
testcase_04 AC 466 ms
172,544 KB
testcase_05 AC 474 ms
184,876 KB
testcase_06 AC 505 ms
173,028 KB
testcase_07 AC 474 ms
184,796 KB
testcase_08 AC 481 ms
184,772 KB
testcase_09 AC 483 ms
172,832 KB
testcase_10 AC 317 ms
172,300 KB
testcase_11 AC 429 ms
184,612 KB
testcase_12 AC 506 ms
184,652 KB
testcase_13 AC 470 ms
172,652 KB
testcase_14 AC 402 ms
184,580 KB
testcase_15 AC 432 ms
184,680 KB
testcase_16 AC 492 ms
185,256 KB
testcase_17 AC 498 ms
172,832 KB
testcase_18 AC 500 ms
174,012 KB
testcase_19 AC 407 ms
172,244 KB
testcase_20 AC 515 ms
172,388 KB
testcase_21 AC 424 ms
184,828 KB
testcase_22 AC 307 ms
171,988 KB
testcase_23 AC 686 ms
191,192 KB
testcase_24 AC 671 ms
190,552 KB
testcase_25 AC 666 ms
191,000 KB
testcase_26 AC 683 ms
190,680 KB
testcase_27 AC 662 ms
179,308 KB
testcase_28 AC 660 ms
179,032 KB
testcase_29 AC 673 ms
179,940 KB
testcase_30 AC 648 ms
190,388 KB
testcase_31 AC 649 ms
190,756 KB
testcase_32 AC 687 ms
191,416 KB
testcase_33 AC 1,091 ms
211,604 KB
testcase_34 AC 1,122 ms
222,604 KB
testcase_35 AC 1,101 ms
223,256 KB
testcase_36 AC 1,108 ms
211,888 KB
testcase_37 AC 1,143 ms
211,344 KB
testcase_38 AC 1,119 ms
219,860 KB
testcase_39 AC 1,139 ms
219,976 KB
testcase_40 AC 1,141 ms
220,408 KB
testcase_41 AC 1,143 ms
220,064 KB
testcase_42 AC 1,111 ms
208,648 KB
testcase_43 AC 1,139 ms
219,672 KB
testcase_44 AC 1,141 ms
220,356 KB
testcase_45 AC 1,122 ms
220,564 KB
testcase_46 AC 1,150 ms
208,008 KB
testcase_47 AC 1,203 ms
207,472 KB
testcase_48 AC 294 ms
183,476 KB
testcase_49 AC 297 ms
183,176 KB
testcase_50 AC 1,182 ms
208,400 KB
testcase_51 AC 1,129 ms
220,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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 = -1-(-1 << 31)
inf = -1-(-1 << 62)

# 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

def op(x, y):
    h1, s1 = divmod(x, 1 << shift)
    h2, s2 = divmod(y, 1 << shift)
    h = (h1*power[s2]%md+h2)%md
    s = s1+s2
    return h << shift | s

# treeの単位元
e = 0

# lazy(f)からtree(x)への操作
def mapping(f, x):
    if f == 0: return x
    h, s = divmod(x, 1 << shift)
    h += ones[s]*f
    h %= md
    return h << shift | s

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

# lazyの単位元
_id = 0

from random import randrange

shift=20
md = 4398042316799
base = randrange(30000000, 40000000)
power = [1]
ones = [0]
for _ in range(10**6):
    power.append(power[-1]*base%md)
    ones.append((ones[-1]*base+1)%md)

n, Q = LI()
seg = LazySegTree(op, e, mapping, composition, _id, [1]*n)
h2q={0:0}
h=0
for q in range(1,Q+1):
    t,*data=SI().split()
    if t=="!":
        l,r,k=map(int,data)
        seg.apply(l,r,k)
        h=seg.all_prod()>>shift
        if h not in h2q:h2q[h]=q
    else:
        print(h2q[h])
0