結果

問題 No.1558 Derby Live
ユーザー phspls
提出日時 2022-10-29 14:49:44
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 190 ms / 2,000 ms
コード長 3,342 bytes
コンパイル時間 28,041 ms
コンパイル使用メモリ 400,928 KB
実行使用メモリ 17,792 KB
最終ジャッジ日時 2024-07-06 13:32:18
合計ジャッジ時間 31,941 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 33
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:5:5
  |
3 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
4 |     n: usize,
5 |     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:44:8
   |
11 | / impl<F, T> SegmentTree<F, T> where
12 | | T: std::fmt::Debug + Clone,
13 | | F: Fn(&T, &T) -> T
   | |__________________- method in this implementation
...
44 |       fn get(&mut self, pos: usize) -> &T {
   |          ^^^

warning: variable `UNIT` should have a snake case name
  --> src/main.rs:84:9
   |
84 |     let UNIT = (0..n).collect::<Vec<_>>();
   |         ^^^^ help: convert the identifier to snake case: `unit`
   |
   = note: `#[warn(non_snake_case)]` on by default

ソースコード

diff #
プレゼンテーションモードにする

#[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 + Clone,
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.clone(),
            mem: vec![unit.clone().to_owned(); 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)]).clone().to_owned();
        }
    }
    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.clone();
        } else if a <= l && r <= b {
            return self.mem[nodenum].clone();
        }
        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 nmq = String::new();
    std::io::stdin().read_line(&mut nmq).ok();
    let nmq: Vec<usize> = nmq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nmq[0];
    let m = nmq[1];
    let q = nmq[2];
    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
        })
        .collect::<Vec<_>>();
    let UNIT = (0..n).collect::<Vec<_>>();
    let operator = |left: &Vec<usize>, right: &Vec<usize>| {
        let mut ret = vec![0usize; left.len()];
        for i in 0..left.len() {
            ret[i] = right[left[i]];
        }
        ret
    };
    let mut segtree = SegmentTree::new(m, UNIT, operator);
    for v in queries.iter() {
        let t = v[0];
        if t == 1 {
            let d = v[1]-1;
            let p = v.iter().skip(2).map(|&v| v-1).collect::<Vec<_>>();
            segtree.set(d, p);
        } else if t == 2 {
            let s = v[1]-1;
            let res = segtree.find_closed(0, s);
            let mut ret = vec![0usize; n];
            for i in 0..n {
                ret[res[i]] = i+1;
            }
            println!("{}", ret.iter().map(|&v| v.to_string()).collect::<Vec<_>>().join(" "));
        } else {
            let l = v[1]-1;
            let r = v[2]-1;
            let res = segtree.find_closed(l, r);
            println!("{}", (0..n).map(|i| (res[i] as isize - i as isize).abs()).sum::<isize>());
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0