結果

問題 No.1778 括弧列クエリ / Bracketed Sequence Query
ユーザー ntudantuda
提出日時 2024-07-23 22:33:11
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,474 bytes
コンパイル時間 450 ms
コンパイル使用メモリ 82,152 KB
実行使用メモリ 128,040 KB
最終ジャッジ日時 2024-07-23 22:33:42
合計ジャッジ時間 29,402 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 62 ms
67,948 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 65 ms
69,608 KB
testcase_22 AC 64 ms
68,296 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 875 ms
128,040 KB
testcase_27 AC 659 ms
128,040 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
dicpair = {}
prs = []  # pairs
st = []  # stack
lv = 0
X = [0] * (N + 3)
for i, s in enumerate(S):
    if s == "(":
        st.append(i)
        X[i + 1] = X[i] + 1
    else:
        X[i + 1] = X[i] - 1
        j = st.pop()
        dicpair[i] = j
        dicpair[j] = i
        prs.append((j, i))
st = SegTree(min, INF, X)

for _ in range(Q):
    a, c = map(int, input().split())
    b = dicpair[a]
    if a > b:
        a, b = b, a
    d = dicpair[c]
    if c > d:
        c, d = d, c
    if a > c:
        a, c = c, a
        b, d = d, a
    if a <= c and d <= b:
        print(a, b)
        continue
    btm = st.prod(b, d)
    a1 = st.min_left(a, lambda v: v > btm)
    d1 = st.max_right(d, lambda v: v > btm)
    b1 = dicpair[a1]
    if d1 <= b1:
        ans = (a1, d1)
    else:
        c1 = dicpair[d1]
        ans = (c1, d1)
    if ans[0] == 0:
        print(-1)
    else:
        print(*ans)
0