結果

問題 No.2065 Sum of Min
ユーザー phsplsphspls
提出日時 2022-09-10 00:22:09
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 262 ms / 2,000 ms
コード長 3,156 bytes
コンパイル時間 14,897 ms
コンパイル使用メモリ 377,688 KB
実行使用メモリ 13,440 KB
最終ジャッジ日時 2024-05-04 13:28:20
合計ジャッジ時間 19,726 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 0 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 199 ms
12,928 KB
testcase_05 AC 186 ms
12,928 KB
testcase_06 AC 236 ms
12,568 KB
testcase_07 AC 177 ms
13,440 KB
testcase_08 AC 240 ms
13,392 KB
testcase_09 AC 219 ms
13,332 KB
testcase_10 AC 198 ms
13,332 KB
testcase_11 AC 193 ms
13,332 KB
testcase_12 AC 256 ms
13,332 KB
testcase_13 AC 245 ms
13,332 KB
testcase_14 AC 251 ms
13,332 KB
testcase_15 AC 249 ms
13,328 KB
testcase_16 AC 262 ms
13,328 KB
testcase_17 AC 248 ms
13,332 KB
testcase_18 AC 245 ms
13,336 KB
testcase_19 AC 246 ms
13,332 KB
testcase_20 AC 241 ms
13,332 KB
testcase_21 AC 248 ms
13,332 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:7:5
  |
5 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
6 |     n: usize,
7 |     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: method `get` is never used
  --> src/main.rs:46:8
   |
13 | / impl<F, T> SegmentTree<F, T> where
14 | | T: std::fmt::Debug + Copy,
15 | | F: Fn(T, T) -> T
   | |________________- method in this implementation
...
46 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff # 

use std::{collections::BinaryHeap, cmp::Reverse};


#[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<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut queries = (0..q).map(|i| {
            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[0]-1, temp[1]-1, temp[2], i)
        })
        .collect::<Vec<(usize, usize, usize, usize)>>();

    let mut result = vec![0usize; q];
    queries.sort_by_key(|&(_, _, x, _)| x);
    let mut valseg = SegmentTree::new(n, 0usize, |x, y| x+y);
    let mut cntseg = SegmentTree::new(n, 0usize, |x, y| x+y);
    let mut avals = BinaryHeap::new();
    for i in 0..n { avals.push((Reverse(a[i]), i))}
    for &(l, r, x, qidx) in queries.iter() {
        while !avals.is_empty() && (avals.peek().unwrap().0).0 <= x {
            let (val, pos) = avals.pop().unwrap();
            valseg.set(pos, val.0);
            cntseg.set(pos, 1);
        }
        result[qidx] = valseg.find_closed(l, r) + (r-l+1-cntseg.find_closed(l, r)) * x;
    }
    for &v in result.iter() {
        println!("{}", v);
    }
}
0