結果

問題 No.1705 Mode of long array
ユーザー yuusanlondonyuusanlondon
提出日時 2021-10-02 07:33:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 445 ms / 3,000 ms
コード長 4,007 bytes
コンパイル時間 188 ms
コンパイル使用メモリ 82,116 KB
実行使用メモリ 109,948 KB
最終ジャッジ日時 2024-07-23 03:49:41
合計ジャッジ時間 19,114 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
67,712 KB
testcase_01 AC 68 ms
67,840 KB
testcase_02 AC 67 ms
67,840 KB
testcase_03 AC 129 ms
78,544 KB
testcase_04 AC 123 ms
78,720 KB
testcase_05 AC 144 ms
79,548 KB
testcase_06 AC 197 ms
80,492 KB
testcase_07 AC 197 ms
80,284 KB
testcase_08 AC 194 ms
80,088 KB
testcase_09 AC 196 ms
80,128 KB
testcase_10 AC 191 ms
79,996 KB
testcase_11 AC 197 ms
79,988 KB
testcase_12 AC 193 ms
80,076 KB
testcase_13 AC 414 ms
101,408 KB
testcase_14 AC 324 ms
87,340 KB
testcase_15 AC 342 ms
82,816 KB
testcase_16 AC 384 ms
84,060 KB
testcase_17 AC 320 ms
82,928 KB
testcase_18 AC 301 ms
82,484 KB
testcase_19 AC 407 ms
87,528 KB
testcase_20 AC 314 ms
83,984 KB
testcase_21 AC 355 ms
97,048 KB
testcase_22 AC 445 ms
108,184 KB
testcase_23 AC 233 ms
79,244 KB
testcase_24 AC 237 ms
79,360 KB
testcase_25 AC 232 ms
79,452 KB
testcase_26 AC 229 ms
79,440 KB
testcase_27 AC 222 ms
79,192 KB
testcase_28 AC 231 ms
79,124 KB
testcase_29 AC 229 ms
79,216 KB
testcase_30 AC 230 ms
78,976 KB
testcase_31 AC 229 ms
79,360 KB
testcase_32 AC 232 ms
79,232 KB
testcase_33 AC 399 ms
109,464 KB
testcase_34 AC 377 ms
109,468 KB
testcase_35 AC 399 ms
109,492 KB
testcase_36 AC 379 ms
109,484 KB
testcase_37 AC 385 ms
109,824 KB
testcase_38 AC 382 ms
109,584 KB
testcase_39 AC 381 ms
109,824 KB
testcase_40 AC 381 ms
109,664 KB
testcase_41 AC 395 ms
109,600 KB
testcase_42 AC 411 ms
109,484 KB
testcase_43 AC 357 ms
109,588 KB
testcase_44 AC 408 ms
109,572 KB
testcase_45 AC 419 ms
109,712 KB
testcase_46 AC 417 ms
109,460 KB
testcase_47 AC 420 ms
109,656 KB
testcase_48 AC 426 ms
109,568 KB
testcase_49 AC 420 ms
109,588 KB
testcase_50 AC 436 ms
109,868 KB
testcase_51 AC 412 ms
109,564 KB
testcase_52 AC 418 ms
109,948 KB
testcase_53 AC 401 ms
109,460 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