結果

問題 No.878 Range High-Element Query
ユーザー sgswsgsw
提出日時 2021-08-13 17:18:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 620 ms / 2,000 ms
コード長 6,666 bytes
コンパイル時間 153 ms
コンパイル使用メモリ 82,024 KB
実行使用メモリ 119,060 KB
最終ジャッジ日時 2024-10-03 07:47:52
合計ジャッジ時間 6,298 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
68,044 KB
testcase_01 AC 87 ms
78,056 KB
testcase_02 AC 96 ms
78,736 KB
testcase_03 AC 88 ms
78,296 KB
testcase_04 AC 93 ms
78,824 KB
testcase_05 AC 94 ms
78,068 KB
testcase_06 AC 79 ms
77,776 KB
testcase_07 AC 85 ms
77,632 KB
testcase_08 AC 107 ms
78,304 KB
testcase_09 AC 114 ms
78,292 KB
testcase_10 AC 81 ms
77,908 KB
testcase_11 AC 578 ms
115,992 KB
testcase_12 AC 496 ms
109,748 KB
testcase_13 AC 463 ms
102,532 KB
testcase_14 AC 393 ms
97,676 KB
testcase_15 AC 494 ms
109,944 KB
testcase_16 AC 620 ms
119,060 KB
testcase_17 AC 615 ms
114,144 KB
testcase_18 AC 597 ms
112,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import types

_atcoder_code = """
# Python port of AtCoder Library.
__all__ = ["string","lazysegtree","convolution","maxflow","modint"
    ,"mincostflow","segtree","_scc","_math","math","dsu","twosat","fenwicktree","scc","_bit","lca","unverified","graph","matrix","algebra","combinatorics"]
__version__ = '0.0.1'
"""

atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)

_atcoder__bit_code = """
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
"""

atcoder._bit = types.ModuleType('atcoder._bit')
exec(_atcoder__bit_code, atcoder._bit.__dict__)


_atcoder_segtree_code = """
import typing

# import atcoder._bit


class SegTree:
 
    '''
    Segment Tree Library.
    op(S,S) -> S
    e = Identity element
    
    SegTree(op,e,n) := Initialized by [e]*(n)
    SegTree(op,e,vector) := Initialized by vector
    '''

    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 = atcoder._bit._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:
        '''
        a[p] -> x in O(logN).
        '''
        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 increment(self, p: int, x : typing.Any) -> None:
        '''
        a[p] -> a[p] + x in O(logN).
        '''
        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:
        '''
        return a[p] in O(1).
        '''
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        '''
        return op(a[l...r)) in O(logN).
        '''
        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:
        '''
        let f(S) -> bool and l is const.
        return maximum r for which f(op[l...r)) == true is satisfied, in O(logN).
        '''
        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:
        '''
        let f(S) -> bool and r is const.
        return minimum l for which f(op[l...r)) == true is satisfied, in O(logN).
        '''

        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])
"""

atcoder.segtree = types.ModuleType('atcoder.segtree')
atcoder.segtree.__dict__['atcoder'] = atcoder
atcoder.segtree.__dict__['atcoder._bit'] = atcoder._bit
exec(_atcoder_segtree_code, atcoder.segtree.__dict__)
SegTree = atcoder.segtree.SegTree


import typing
import sys


def input():
    return sys.stdin.readline().rstrip()


DXY = [(0, -1), (1, 0), (0, 1), (-1, 0)]  # LDRU
mod = 998244353
inf = 1 << 64
# from atcoder.segtree import SegTree

def generate_table(array:typing.List) -> typing.List[int]:
    n = len(array)
    arr = [(-array[i],i) for i in range(n)]
    arr.sort(key = lambda x: x[0])
    seg = SegTree(lambda x,y : x | y,0,n + 1)
    seg.set(0,1)#pos 0 is sentinel.
    res = [-inf]*(n)
    for _,idx in arr:
        pos = seg.min_left(idx + 1,lambda x : x == 0)
        pos -= 1
        seg.set(idx + 1,1)
        if pos > 0:
            res[idx] = pos - 1
    return res 


def main():
    n, q = map(int, input().split())
    a = list(map(int, input().split()))
    Query = []
    for i in range(q):
        _, l, r = map(int, input().split())
        l -= 1
        Query.append((l, r, i))

    pref_table = generate_table(a)
    remove_order = [(pref_table[i],i) for i in range(n)]
    remove_order.sort(key = lambda x: -x[0])
    Query.sort(key = lambda x: -x[0])

    itr = 0

    seg = SegTree(lambda x,y : x + y,0,[1]*(n))

    ans = [0]*(q)

    for l,r,idx in Query:
        while itr < n and remove_order[itr][0] >= l:
            seg.set(remove_order[itr][1],0)
            itr+= 1
        ans[idx] = seg.prod(l,r)
    print(*ans,sep = "\n")
    return 0


if __name__ == "__main__":
    main()
0