結果

問題 No.1558 Derby Live
ユーザー mkawa2mkawa2
提出日時 2023-11-15 14:21:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 685 ms / 2,000 ms
コード長 4,563 bytes
コンパイル時間 389 ms
コンパイル使用メモリ 82,364 KB
実行使用メモリ 113,024 KB
最終ジャッジ日時 2024-09-26 04:36:05
合計ジャッジ時間 24,298 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 539 ms
91,868 KB
testcase_01 AC 613 ms
113,024 KB
testcase_02 AC 71 ms
67,712 KB
testcase_03 AC 498 ms
90,208 KB
testcase_04 AC 404 ms
88,572 KB
testcase_05 AC 411 ms
88,328 KB
testcase_06 AC 537 ms
97,056 KB
testcase_07 AC 127 ms
80,256 KB
testcase_08 AC 526 ms
97,660 KB
testcase_09 AC 549 ms
98,652 KB
testcase_10 AC 572 ms
100,668 KB
testcase_11 AC 562 ms
100,540 KB
testcase_12 AC 592 ms
102,920 KB
testcase_13 AC 592 ms
102,144 KB
testcase_14 AC 626 ms
104,448 KB
testcase_15 AC 630 ms
105,152 KB
testcase_16 AC 649 ms
106,880 KB
testcase_17 AC 659 ms
107,264 KB
testcase_18 AC 671 ms
108,288 KB
testcase_19 AC 671 ms
109,044 KB
testcase_20 AC 681 ms
109,440 KB
testcase_21 AC 654 ms
107,392 KB
testcase_22 AC 662 ms
109,056 KB
testcase_23 AC 670 ms
109,568 KB
testcase_24 AC 645 ms
107,664 KB
testcase_25 AC 672 ms
109,260 KB
testcase_26 AC 684 ms
109,512 KB
testcase_27 AC 673 ms
108,160 KB
testcase_28 AC 664 ms
109,824 KB
testcase_29 AC 683 ms
109,952 KB
testcase_30 AC 663 ms
107,980 KB
testcase_31 AC 685 ms
109,056 KB
testcase_32 AC 668 ms
109,056 KB
testcase_33 AC 71 ms
67,712 KB
testcase_34 AC 72 ms
68,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(1000005)
# 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 << 63)
# md = 10**9+7
md = 998244353

import typing

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 = (self._n-1).bit_length()
        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])

def op(xx,yy):
    return [yy[x-1] for x in xx]

n,m,q=LI()

e=list(range(1,n+1))
st=SegTree(op,e,m)

for _ in range(q):
    t,*data=LI()
    if t==1:
        i,*pp=data
        st.set(i-1,pp)
    if t==2:
        i=data[0]
        pp=st.prod(0,i)
        ans=sorted(range(1,n+1),key=lambda i:pp[i-1])
        print(*ans)
    if t==3:
        l,r=data
        l-=1
        pp=st.prod(l,r)
        ans=sum(abs(i+1-p) for i,p in enumerate(pp))
        print(ans)
    # print(t,st._d)
0