結果

問題 No.1705 Mode of long array
ユーザー yuusanlondonyuusanlondon
提出日時 2021-10-02 07:33:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 453 ms / 3,000 ms
コード長 4,007 bytes
コンパイル時間 1,599 ms
コンパイル使用メモリ 86,692 KB
実行使用メモリ 112,488 KB
最終ジャッジ日時 2023-09-30 09:44:48
合計ジャッジ時間 22,500 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 137 ms
80,588 KB
testcase_01 AC 134 ms
80,700 KB
testcase_02 AC 140 ms
80,596 KB
testcase_03 AC 186 ms
83,432 KB
testcase_04 AC 175 ms
82,796 KB
testcase_05 AC 200 ms
84,028 KB
testcase_06 AC 237 ms
84,792 KB
testcase_07 AC 240 ms
84,424 KB
testcase_08 AC 246 ms
85,008 KB
testcase_09 AC 241 ms
84,900 KB
testcase_10 AC 239 ms
85,020 KB
testcase_11 AC 267 ms
84,968 KB
testcase_12 AC 259 ms
84,476 KB
testcase_13 AC 448 ms
106,332 KB
testcase_14 AC 342 ms
96,752 KB
testcase_15 AC 365 ms
88,628 KB
testcase_16 AC 379 ms
90,280 KB
testcase_17 AC 329 ms
88,764 KB
testcase_18 AC 322 ms
89,216 KB
testcase_19 AC 397 ms
94,008 KB
testcase_20 AC 327 ms
91,436 KB
testcase_21 AC 366 ms
103,696 KB
testcase_22 AC 428 ms
111,612 KB
testcase_23 AC 275 ms
83,296 KB
testcase_24 AC 263 ms
83,636 KB
testcase_25 AC 268 ms
83,304 KB
testcase_26 AC 285 ms
83,248 KB
testcase_27 AC 257 ms
84,160 KB
testcase_28 AC 267 ms
83,196 KB
testcase_29 AC 281 ms
83,136 KB
testcase_30 AC 262 ms
83,376 KB
testcase_31 AC 274 ms
83,116 KB
testcase_32 AC 270 ms
83,136 KB
testcase_33 AC 370 ms
112,040 KB
testcase_34 AC 360 ms
112,296 KB
testcase_35 AC 378 ms
112,464 KB
testcase_36 AC 367 ms
112,376 KB
testcase_37 AC 353 ms
112,436 KB
testcase_38 AC 348 ms
112,312 KB
testcase_39 AC 347 ms
112,188 KB
testcase_40 AC 352 ms
112,440 KB
testcase_41 AC 377 ms
112,296 KB
testcase_42 AC 377 ms
112,328 KB
testcase_43 AC 386 ms
112,272 KB
testcase_44 AC 425 ms
112,272 KB
testcase_45 AC 453 ms
112,332 KB
testcase_46 AC 418 ms
112,464 KB
testcase_47 AC 429 ms
112,404 KB
testcase_48 AC 436 ms
112,488 KB
testcase_49 AC 392 ms
112,300 KB
testcase_50 AC 445 ms
112,368 KB
testcase_51 AC 416 ms
112,220 KB
testcase_52 AC 406 ms
112,352 KB
testcase_53 AC 402 ms
112,372 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,m=map(int,input().split())
a=list(map(int,input().split()))
q=int(input())
b=[]
for i in range(m):
  b.append((a[i],i+1))
def comb(x1,x2):
  d1,pos1=x1
  d2,pos2=x2
  if d1>d2:
    return (d1,pos1)
  else:
    return (d2,pos2)
segtree=SegTree(comb,(-1,-1),b)
for _ in range(q):
  t,x,y=map(int,input().split())
  if t==1:
    d,pos=segtree.get(x-1)
    segtree.set(x-1,(d+y,x))
  elif t==2:
    d,pos=segtree.get(x-1)
    segtree.set(x-1,(d-y,x))
  else:
    d,pos=segtree.all_prod()
    print(pos)
0