結果

問題 No.1802 Range Score Query for Bracket Sequence
ユーザー phspls
提出日時 2022-10-15 13:03:57
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 402 ms / 2,000 ms
コード長 3,111 bytes
コンパイル時間 11,924 ms
コンパイル使用メモリ 380,152 KB
実行使用メモリ 26,496 KB
最終ジャッジ日時 2024-06-30 02:25:04
合計ジャッジ時間 17,446 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 24
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:5:5
  |
3 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
4 |     n: usize,
5 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

ソースコード

diff #
プレゼンテーションモードにする

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    operator: F
}
impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
    fn new(n: usize, unit: T, operator: F) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit,
            mem: vec![unit; size*2-1],
            operator: operator,
        }
    }
    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }
    fn find(&self, l: usize, r: usize) -> T {
        self._find(l, r, 0, 0, self.n)
    }
    fn set(&mut self, pos: usize, val: T) {
        let mut pos = pos + self.n - 1;
        self.mem[pos] = val;
        while pos > 0 {
            pos = self._parent(pos);
            self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
        }
    }
    fn get(&mut self, pos: usize) -> T {
        self.mem[pos + self.n - 1]
    }
    fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.unit;
        } else if a <= l && r <= b {
            return self.mem[nodenum];
        }
        let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
        let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
        (self.operator)(left, right)
    }
    fn _left(&self, k: usize) -> usize {
        2*k+1
    }
    fn _right(&self, k: usize) -> usize {
        2*k+2
    }
    fn _parent(&self, k: usize) -> usize {
        (k-1)/2
    }
}
fn main() {
    let mut nq = String::new();
    std::io::stdin().read_line(&mut nq).ok();
    let nq: Vec<usize> = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nq[0];
    let q = nq[1];
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let s = s.trim().chars().collect::<Vec<_>>();
    let queries = (0..q).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            temp
        })
        .collect::<Vec<_>>();
    let mut segtree = SegmentTree::new(n, (0isize, 0isize, 0isize), |(lstart, lend, lcnt), (rstart, rend, rcnt)| (lstart, rend, if lend == 1 && 
        rstart == -1 { 1 } else { 0 } + lcnt + rcnt));
    let getval = |c: char| { if c == '(' { (1, 1, 0) } else { (-1, -1, 0) } };
    for i in 0..n {
        segtree.set(i, getval(s[i]));
    }
    for v in queries.iter() {
        if v[0] == 1 {
            let idx = v[1]-1;
            let (val, _, _) = segtree.get(idx);
            if val == -1 {
                segtree.set(idx, (1, 1, 0));
            } else {
                segtree.set(idx, (-1, -1, 0));
            }
        } else {
            let l = v[1]-1;
            let r = v[2]-1;
            let (_, _, summary) = segtree.find_closed(l, r);
            println!("{}", summary);
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0