結果

問題 No.2065 Sum of Min
ユーザー koba-e964koba-e964
提出日時 2022-09-03 00:44:16
言語 Rust
(1.77.0)
結果
AC  
実行時間 265 ms / 2,000 ms
コード長 4,940 bytes
コンパイル時間 16,697 ms
コンパイル使用メモリ 381,424 KB
実行使用メモリ 25,308 KB
最終ジャッジ日時 2024-04-28 00:58:22
合計ジャッジ時間 18,645 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 164 ms
25,308 KB
testcase_05 AC 110 ms
16,720 KB
testcase_06 AC 57 ms
16,976 KB
testcase_07 AC 88 ms
13,684 KB
testcase_08 AC 99 ms
18,252 KB
testcase_09 AC 154 ms
21,988 KB
testcase_10 AC 112 ms
16,976 KB
testcase_11 AC 137 ms
16,848 KB
testcase_12 AC 265 ms
21,992 KB
testcase_13 AC 165 ms
22,104 KB
testcase_14 AC 165 ms
22,000 KB
testcase_15 AC 156 ms
22,096 KB
testcase_16 AC 168 ms
21,996 KB
testcase_17 AC 167 ms
21,992 KB
testcase_18 AC 161 ms
21,960 KB
testcase_19 AC 162 ms
21,968 KB
testcase_20 AC 156 ms
21,972 KB
testcase_21 AC 174 ms
22,112 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($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. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 *              yukicoder No. 833 (https://yukicoder.me/submissions/703521)
 */
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) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    #[allow(unused)]
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        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)
    }
}

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
    }
}

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,
        a: [i64; n],
        lrx: [(usize1, usize, i64); q],
    }
    let mut qs = vec![vec![]; n + 1];
    let mut ans = vec![0; q];
    for i in 0..q {
        let (l, r, x) = lrx[i];
        qs[l].push((x, i, -1));
        qs[r].push((x, i, 1));
    }
    let mut coo = a.clone();
    coo.sort(); coo.dedup();
    let m = coo.len();
    let mut st = SegTree::new(m, |x, y| x + y, 0i64);
    let mut sta = SegTree::new(m, |x, y| x + y, 0i64);
    for i in 1..n + 1 {
        let idx = coo.binary_search(&a[i - 1]).unwrap();
        st.update(idx, st.query(idx, idx + 1) + 1);
        sta.update(idx, sta.query(idx, idx + 1) + a[i - 1]);
        for &(x, aidx, coef) in &qs[i] {
            let xidx = coo.lower_bound(&x);
            let tmp = x * st.query(xidx, m) + sta.query(0, xidx);
            ans[aidx] += tmp * coef;
        }
    }
    for i in 0..q {
        puts!("{}\n", ans[i]);
    }
}
0