結果
問題 | No.1778 括弧列クエリ / Bracketed Sequence Query |
ユーザー | koba-e964 |
提出日時 | 2021-12-09 20:28:34 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 135 ms / 2,000 ms |
コード長 | 4,577 bytes |
コンパイル時間 | 2,241 ms |
コンパイル使用メモリ | 156,640 KB |
実行使用メモリ | 12,488 KB |
最終ジャッジ日時 | 2023-09-24 12:23:46 |
合計ジャッジ時間 | 7,948 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
4,980 KB |
testcase_01 | AC | 58 ms
5,040 KB |
testcase_02 | AC | 56 ms
4,976 KB |
testcase_03 | AC | 48 ms
5,112 KB |
testcase_04 | AC | 60 ms
5,136 KB |
testcase_05 | AC | 68 ms
6,664 KB |
testcase_06 | AC | 40 ms
4,380 KB |
testcase_07 | AC | 5 ms
4,376 KB |
testcase_08 | AC | 132 ms
11,452 KB |
testcase_09 | AC | 16 ms
5,088 KB |
testcase_10 | AC | 60 ms
9,116 KB |
testcase_11 | AC | 51 ms
6,520 KB |
testcase_12 | AC | 72 ms
6,992 KB |
testcase_13 | AC | 123 ms
11,168 KB |
testcase_14 | AC | 52 ms
8,852 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 135 ms
11,556 KB |
testcase_17 | AC | 133 ms
11,492 KB |
testcase_18 | AC | 132 ms
11,480 KB |
testcase_19 | AC | 131 ms
11,464 KB |
testcase_20 | AC | 133 ms
11,556 KB |
testcase_21 | AC | 1 ms
4,384 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 105 ms
10,984 KB |
testcase_24 | AC | 109 ms
11,496 KB |
testcase_25 | AC | 135 ms
11,468 KB |
testcase_26 | AC | 109 ms
12,424 KB |
testcase_27 | AC | 73 ms
12,488 KB |
ソースコード
use std::cmp::*; 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: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]); } } } // 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 } } fn main() { 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); } } 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); } } }