結果

問題 No.1778 括弧列クエリ / Bracketed Sequence Query
ユーザー ntudantuda
提出日時 2024-07-27 15:03:46
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,030 ms / 2,000 ms
コード長 4,184 bytes
コンパイル時間 408 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 101,504 KB
最終ジャッジ日時 2024-07-27 15:04:11
合計ジャッジ時間 24,205 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 759 ms
81,080 KB
testcase_01 AC 825 ms
80,516 KB
testcase_02 AC 779 ms
80,788 KB
testcase_03 AC 739 ms
81,384 KB
testcase_04 AC 800 ms
81,164 KB
testcase_05 AC 634 ms
86,744 KB
testcase_06 AC 503 ms
82,112 KB
testcase_07 AC 178 ms
82,416 KB
testcase_08 AC 1,010 ms
100,992 KB
testcase_09 AC 320 ms
86,124 KB
testcase_10 AC 601 ms
96,000 KB
testcase_11 AC 526 ms
88,672 KB
testcase_12 AC 685 ms
86,820 KB
testcase_13 AC 959 ms
100,480 KB
testcase_14 AC 555 ms
94,924 KB
testcase_15 AC 63 ms
67,840 KB
testcase_16 AC 1,002 ms
101,504 KB
testcase_17 AC 1,018 ms
101,504 KB
testcase_18 AC 1,003 ms
101,180 KB
testcase_19 AC 1,024 ms
100,480 KB
testcase_20 AC 1,025 ms
101,248 KB
testcase_21 AC 62 ms
67,584 KB
testcase_22 AC 63 ms
67,584 KB
testcase_23 AC 896 ms
96,208 KB
testcase_24 AC 899 ms
100,736 KB
testcase_25 AC 993 ms
100,520 KB
testcase_26 AC 1,030 ms
98,600 KB
testcase_27 AC 730 ms
98,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


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 = _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, Q = map(int, input().split())
S = "(" + input() + ")"
INF = N
pairs = [0] * (N + 2)
sta = []  # stack
base = []
lv = 0
X = [0] * (N + 3)

for i, s in enumerate(S):
    if s == "(":
        sta.append((lv, i))
        lv += 1
    else:
        lv -= 1
        _, j = sta.pop()
        pairs[i] = j
        pairs[j] = i
    if i < N + 1:
        base.append(sta[-1])
st = SegTree(min, (INF, 0), base)

for _ in range(Q):
    a, b = map(int, input().split())
    if a > b:
        a, b = b, a
    if a == b:
        x = a
    else:
        _, x = st.prod(a, b)
    y = pairs[x]
    if x > y:
        x, y = y, x
    if x == 0:
        print(-1)
    else:
        print(x, y)
0