結果

問題 No.876 Range Compress Query
ユーザー phsplsphspls
提出日時 2022-11-22 02:35:03
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 140 ms / 2,000 ms
コード長 3,028 bytes
コンパイル時間 13,807 ms
コンパイル使用メモリ 386,920 KB
実行使用メモリ 12,672 KB
最終ジャッジ日時 2024-09-22 14:31:41
合計ジャッジ時間 16,809 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 140 ms
12,032 KB
testcase_12 AC 116 ms
10,368 KB
testcase_13 AC 113 ms
10,624 KB
testcase_14 AC 139 ms
11,904 KB
testcase_15 AC 93 ms
9,728 KB
testcase_16 AC 130 ms
12,160 KB
testcase_17 AC 130 ms
12,160 KB
testcase_18 AC 138 ms
12,672 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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

warning: methods `find_closed` and `get` are never used
  --> src/main.rs:27:8
   |
11 | / impl<F, T> SegmentTree<F, T> where
12 | | T: std::fmt::Debug + Copy,
13 | | F: Fn(T, T) -> T
   | |________________- methods in this implementation
...
27 |       fn find_closed(&self, l: usize, r: usize) -> T {
   |          ^^^^^^^^^^^
...
44 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

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 a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<isize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    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 b = vec![0isize; n+1];
    for i in 1..n { b[i] = a[i] - a[i-1]; }
    b[0] = a[0];
    b[n] = -a[n-1];
    let mut segtree = SegmentTree::new(n+1, 0usize, |x, y| x + y);
    for i in 0..=n {
        segtree.set(i, if b[i] == 0 { 0 } else { 1 });
    }
    for v in queries.iter() {
        let t = v[0];
        let l = v[1]-1;
        let r = v[2]-1;
        if t == 1 {
            let x = v[3] as isize;
            b[l] += x;
            b[r+1] -= x;
            segtree.set(l, if b[l] == 0 { 0 } else { 1 });
            segtree.set(r+1, if b[r+1] == 0 { 0 } else { 1 });
        } else {
            println!("{}", 1 + segtree.find(l+1, r+1));
        }
    }
}
0