結果

問題 No.2065 Sum of Min
ユーザー phsplsphspls
提出日時 2022-09-03 01:44:51
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 309 ms / 2,000 ms
コード長 3,290 bytes
コンパイル時間 13,188 ms
コンパイル使用メモリ 383,736 KB
実行使用メモリ 20,612 KB
最終ジャッジ日時 2024-11-16 09:27:45
合計ジャッジ時間 20,548 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 243 ms
20,092 KB
testcase_05 AC 218 ms
20,096 KB
testcase_06 AC 215 ms
10,656 KB
testcase_07 AC 169 ms
10,976 KB
testcase_08 AC 214 ms
11,460 KB
testcase_09 AC 240 ms
20,372 KB
testcase_10 AC 222 ms
20,504 KB
testcase_11 AC 254 ms
20,612 KB
testcase_12 AC 309 ms
20,492 KB
testcase_13 AC 302 ms
20,496 KB
testcase_14 AC 302 ms
20,376 KB
testcase_15 AC 299 ms
20,484 KB
testcase_16 AC 277 ms
20,372 KB
testcase_17 AC 289 ms
20,516 KB
testcase_18 AC 300 ms
20,544 KB
testcase_19 AC 308 ms
20,488 KB
testcase_20 AC 309 ms
20,480 KB
testcase_21 AC 294 ms
20,488 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:6:5
  |
4 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
5 |     n: usize,
6 |     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:45:8
   |
12 | / impl<F, T> SegmentTree<F, T> where
13 | | T: std::fmt::Debug + Copy,
14 | | F: Fn(T, T) -> T
   | |________________- method in this implementation
...
45 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff # 

use std::collections::BTreeMap;

#[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 btreemap = BTreeMap::new();
    for i in 0..n {
        btreemap.entry(a[i]).or_insert(vec![]).push(i);
    }
    let mut cntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut valseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut result = vec![0usize; q];
    queries.sort_by_key(|&(_,_,x,_)| x);
    for &(l, r, x, i) in queries.iter() {
        let mut used = vec![];
        btreemap.range(..=x).for_each(|(&val, v)| {
            used.push(val);
            for &pos in v.iter() {
                cntseg.set(pos, 1);
                valseg.set(pos, val);
            }
        });
        used.iter().for_each(|v| { btreemap.remove(v); });
        result[i] += valseg.find_closed(l, r);
        result[i] += (r-l+1-cntseg.find_closed(l, r)) * x;
    }
    for &v in result.iter() {
        println!("{}", v);
    }
}
0