#815893 (Rust) No.1441 MErGe

• 問題: No.1441 MErGe
• ユーザー: phspls
• 提出日時: 2022-11-13 01:00:34
• 言語: Rust (1.77.0 + proconio)
• 結果: TLE
• 実行時間: -
• コード長: 3,238 bytes
• コンパイル時間: 14,920 ms
• コンパイル使用メモリ: 379,240 KB
• 実行使用メモリ: 10,624 KB
• 最終ジャッジ日時: 2024-09-14 12:39:53
• 合計ジャッジ時間: 21,841 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 10,624 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	16 ms; 5,376 KB
testcase_04	AC	22 ms; 5,376 KB
testcase_05	AC	135 ms; 5,376 KB
testcase_06	AC	146 ms; 5,376 KB
testcase_07	AC	161 ms; 5,376 KB
testcase_08	TLE	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-

コンパイルメッセージ

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 {
   |          ^^^

ソースコード

use std::collections::BTreeSet;


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

    let mut indices = (0..n).collect::<BTreeSet<_>>();
    let mut segtree = SegmentTree::new(n, 0isize, |x, y| x + y);
    for i in 0..n {
        segtree.set(i, a[i]);
    }
    for &(t, l, r) in queries.iter() {
        if t == 1 {
            let mut targets = indices.iter().skip(l).take(r-l+1).copied().collect::<Vec<_>>();
            let val = segtree.find_closed(targets[0], targets[r-l]);
            for &v in targets.iter() {
                segtree.set(v, 0);
            }
            segtree.set(targets[0], val);
            while targets.len() > 1 {
                indices.remove(&targets.pop().unwrap());
            }
        } else {
            let l = *indices.iter().nth(l).unwrap();
            let r = *indices.iter().nth(r).unwrap();
            println!("{}", segtree.find_closed(l, r));
        }
    }
}