#700067 (Rust) No.876 Range Compress Query

• 問題: No.876 Range Compress Query
• ユーザー: koba-e964
• 提出日時: 2021-09-17 01:49:35
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 116 ms / 2,000 ms
• コード長: 3,480 bytes
• コンパイル時間: 12,243 ms
• コンパイル使用メモリ: 395,028 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-29 17:19:26
• 合計ジャッジ時間: 13,220 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 6,812 KB
testcase_01	AC	1 ms; 6,812 KB
testcase_02	AC	1 ms; 6,816 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	2 ms; 6,944 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	116 ms; 6,940 KB
testcase_12	AC	97 ms; 6,940 KB
testcase_13	AC	99 ms; 6,940 KB
testcase_14	AC	116 ms; 6,940 KB
testcase_15	AC	82 ms; 6,940 KB
testcase_16	AC	110 ms; 6,944 KB
testcase_17	AC	107 ms; 6,944 KB
testcase_18	AC	114 ms; 6,940 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

/**
 * 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)
 */
struct SegTree<I, BiOp> {
    n: 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, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        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/ */
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        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)
    }
}

fn main() {
    let n: usize = get();
    let q: usize = get();
    let a: Vec<i64> = (0..n).map(|_| get()).collect();
    let mut st = SegTree::new(n - 1, |x, y| x + y, 0);
    let mut dif = vec![0; n - 1];
    for i in 0..n - 1 {
        dif[i] = a[i + 1] - a[i];
        if dif[i] != 0 {
            st.update(i, 1);
        }
    }
    for _ in 0..q {
        let ty: i32 = get();
        let l = get::<usize>() - 1;
        let r: usize = get();
        if ty == 1 {
            let x: i64 = get();
            if l > 0 {
                let old = dif[l - 1];
                dif[l - 1] += x;
                if (old != 0) != (dif[l - 1] != 0) {
                    st.update(l - 1, if dif[l - 1] != 0 { 1 } else { 0 });
                }
            }
            if r < n {
                let old = dif[r - 1];
                dif[r - 1] -= x;
                if (old != 0) != (dif[r - 1] != 0) {
                    st.update(r - 1, if dif[r - 1] != 0 { 1 } else { 0 });
                }
            }
        } else {
            println!("{}", st.query(l, r - 1) + 1);
        }
    }
}