結果

問題 No.1778 括弧列クエリ / Bracketed Sequence Query
ユーザー koba-e964koba-e964
提出日時 2021-12-09 20:27:19
言語 Rust
(1.77.0)
結果
AC  
実行時間 615 ms / 2,000 ms
コード長 5,993 bytes
コンパイル時間 2,201 ms
コンパイル使用メモリ 160,204 KB
実行使用メモリ 11,588 KB
最終ジャッジ日時 2023-09-24 12:22:16
合計ジャッジ時間 18,643 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
4,376 KB
testcase_01 AC 59 ms
4,376 KB
testcase_02 AC 58 ms
4,376 KB
testcase_03 AC 46 ms
4,380 KB
testcase_04 AC 61 ms
4,376 KB
testcase_05 AC 260 ms
5,808 KB
testcase_06 AC 83 ms
4,380 KB
testcase_07 AC 106 ms
4,380 KB
testcase_08 AC 600 ms
10,504 KB
testcase_09 AC 176 ms
4,380 KB
testcase_10 AC 413 ms
8,204 KB
testcase_11 AC 292 ms
5,652 KB
testcase_12 AC 260 ms
6,008 KB
testcase_13 AC 576 ms
10,288 KB
testcase_14 AC 370 ms
7,932 KB
testcase_15 AC 1 ms
4,380 KB
testcase_16 AC 615 ms
10,564 KB
testcase_17 AC 601 ms
10,572 KB
testcase_18 AC 604 ms
10,488 KB
testcase_19 AC 613 ms
10,544 KB
testcase_20 AC 603 ms
10,488 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 486 ms
10,148 KB
testcase_24 AC 578 ms
10,512 KB
testcase_25 AC 610 ms
10,580 KB
testcase_26 AC 577 ms
11,588 KB
testcase_27 AC 543 ms
11,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/**
 * Segment Tree. This data structure is useful for fast folding on intervals of an array
 * whose elements are elements of monoid I. Note that constructing this tree requires the identity
 * element of I and the operation of I.
 * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 *              yukicoder No. 833 (https://yukicoder.me/submissions/703521)
 */
struct SegTree<I, BiOp> {
    n: usize,
    orign: usize,
    dat: Vec<I>,
    op: BiOp,
    e: I,
}

impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    pub fn new(n_: usize, op: BiOp, e: I) -> Self {
        let mut n = 1;
        while n < n_ { n *= 2; } // n is a power of 2
        SegTree {n: n, orign: n_, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        debug_assert!(idx < self.orign);
        let mut k = idx + self.n - 1;
        self.dat[k] = v;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    #[allow(unused)]
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        debug_assert!(a <= b);
        debug_assert!(b <= self.orign);
        let mut left = self.e;
        let mut right = self.e;
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a]);
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1], right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

// Depends on: datastr/SegTree.rs
// Verified by: https://yukicoder.me/submissions/717436
impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    // Port from https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp
    #[allow(unused)]
    fn max_right<F: Fn(I) -> bool>(
        &self, mut l: usize, f: &F,
    ) -> usize {
        assert!(f(self.e));
        if l == self.orign {
            return self.orign;
        }
        l += self.n - 1;
        let mut sm = self.e;
        loop {
            while l % 2 == 1 {
                l = (l - 1) / 2;
            }
            if !f((self.op)(sm, self.dat[l])) {
                while l < self.n - 1 {
                    l = 2 * l + 1;
                    let val = (self.op)(sm, self.dat[l]);
                    if f(val) {
                        sm = val;
                        l += 1;
                    }
                }
                return std::cmp::min(self.orign, l + 1 - self.n);
            }
            sm = (self.op)(sm, self.dat[l]);
            l += 1;
            if (l + 1).is_power_of_two() { break; }
        }
        self.orign
    }
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        n: usize, q: usize,
        s: chars,
        xy: [(usize1, usize1); q],
    }
    let mut to = vec![0; n];
    let mut st = vec![];
    for i in 0..n {
        if s[i] == ')' {
            let x = st.pop().unwrap();
            to[x] = i;
            to[i] = x;
        } else {
            st.push(i);
        }
    }
    eprintln!("to = {:?}", to);
    let mut st = SegTree::new(n, min, n);
    for i in 0..n {
        if s[i] == ')' {
            st.update(i, to[i]);
        }
    }
    for (x, y) in xy {
        let mut ma = max(x, y);
        ma = max(ma, max(to[x], to[y]));
        let mut mi = min(x, y);
        mi = min(mi, min(to[x], to[y]));
        let ans = st.max_right(ma, &|a| a > mi);
        if ans >= n {
            puts!("-1\n");
        } else {
            puts!("{} {}\n", to[ans] + 1, ans + 1);
        }
    }
}
0