#880026 (Rust) No.1802 Range Score Query for Bracket Sequence

• 問題: No.1802 Range Score Query for Bracket Sequence
• ユーザー: koba-e964
• 提出日時: 2023-06-12 11:46:39
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 90 ms / 2,000 ms
• コード長: 4,241 bytes
• コンパイル時間: 12,413 ms
• コンパイル使用メモリ: 404,840 KB
• 実行使用メモリ: 15,324 KB
• 最終ジャッジ日時: 2024-06-11 14:37:26
• 合計ジャッジ時間: 16,294 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	90 ms; 15,168 KB
testcase_02	AC	89 ms; 15,248 KB
testcase_03	AC	82 ms; 15,324 KB
testcase_04	AC	81 ms; 15,140 KB
testcase_05	AC	81 ms; 15,060 KB
testcase_06	AC	80 ms; 15,184 KB
testcase_07	AC	78 ms; 15,120 KB
testcase_08	AC	77 ms; 15,192 KB
testcase_09	AC	77 ms; 15,108 KB
testcase_10	AC	88 ms; 15,112 KB
testcase_11	AC	71 ms; 15,176 KB
testcase_12	AC	73 ms; 15,196 KB
testcase_13	AC	70 ms; 15,188 KB
testcase_14	AC	78 ms; 15,192 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB

ソースコード

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 ; $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. 2220 (https://yukicoder.me/submissions/841554)
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) (half-inclusive)
    // http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/
    #[allow(unused)]
    pub fn query(&self, rng: std::ops::Range<usize>) -> I {
        let (mut a, mut b) = (rng.start, rng.end);
        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)
    }
}

// https://yukicoder.me/problems/no/1802 (3)
// 操作によって () という部分文字列が新たにできることはないので、
// 元々ある部分文字列の () の個数が答えである。
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,
        qs: [[usize1]; q],
    }
    let mut s = s;
    let mut st = SegTree::new(n, |x, y| x + y, 0i32);
    macro_rules! set {
        ($e:expr) => {
            let i = $e;
            if i > 0 && i + 1 <= n {
                let val = if s[i - 1..i + 1] == ['(', ')'] {
                    1
                } else {
                    0
                };
                st.update(i - 1, val);
            }
        }
    }
    for i in 0..n - 1 {
        set!(i + 1);
    }
    for q in qs {
        if q.len() == 1 {
            let i = q[0];
            s[i] = if s[i] == '(' { ')' } else { '(' };
            set!(i);
            set!(i + 1);
        } else {
            let l = q[0];
            let r = q[1];
            puts!("{}\n", st.query(l..r));
        }
    }
}