#703279 (Rust) No.789 範囲の合計

• 問題: No.789 範囲の合計
• ユーザー: koba-e964
• 提出日時: 2021-09-27 16:34:03
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 52 ms / 1,000 ms
• コード長: 4,187 bytes
• コンパイル時間: 24,718 ms
• コンパイル使用メモリ: 389,572 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-06 12:19:15
• 合計ジャッジ時間: 18,433 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	52 ms; 6,940 KB
testcase_03	AC	31 ms; 6,944 KB
testcase_04	AC	51 ms; 6,944 KB
testcase_05	AC	39 ms; 6,940 KB
testcase_06	AC	46 ms; 6,944 KB
testcase_07	AC	31 ms; 6,944 KB
testcase_08	AC	42 ms; 6,944 KB
testcase_09	AC	36 ms; 6,940 KB
testcase_10	AC	51 ms; 6,944 KB
testcase_11	AC	34 ms; 6,944 KB
testcase_12	AC	34 ms; 6,940 KB
testcase_13	AC	1 ms; 6,940 KB
testcase_14	AC	1 ms; 6,940 KB

ソースコード

// 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, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

/**
 * 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() {
    input! {
        n: usize,
        abc: [(i32, i64, i64); n],
    }
    let mut coo = vec![];
    for &(a, b, _) in &abc {
        if a == 0 {
            coo.push(b);
        }
    }
    coo.sort(); coo.dedup();
    let m = coo.len();
    let mut st = SegTree::new(m, |x, y| x + y, 0i64);
    let mut ans = 0;
    for &(a, b, c) in &abc {
        if a == 0 {
            let idx = coo.binary_search(&b).unwrap();
            let val = st.query(idx, idx + 1);
            st.update(idx, val + c);
        } else {
            let lo = coo.lower_bound(&b);
            let hi = coo.upper_bound(&c);
            ans += st.query(lo, hi);
        }
    }
    println!("{}", ans);
}