結果

問題 No.1558 Derby Live
ユーザー phsplsphspls
提出日時 2022-11-26 16:11:35
言語 Rust
(1.77.0)
結果
AC  
実行時間 252 ms / 2,000 ms
コード長 3,486 bytes
コンパイル時間 11,676 ms
コンパイル使用メモリ 162,408 KB
実行使用メモリ 17,920 KB
最終ジャッジ日時 2024-04-14 03:03:02
合計ジャッジ時間 14,481 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 252 ms
13,440 KB
testcase_01 AC 222 ms
17,920 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 148 ms
8,576 KB
testcase_04 AC 72 ms
6,940 KB
testcase_05 AC 97 ms
6,944 KB
testcase_06 AC 153 ms
8,960 KB
testcase_07 AC 5 ms
6,944 KB
testcase_08 AC 150 ms
8,960 KB
testcase_09 AC 161 ms
10,368 KB
testcase_10 AC 156 ms
11,008 KB
testcase_11 AC 164 ms
10,880 KB
testcase_12 AC 169 ms
11,392 KB
testcase_13 AC 181 ms
11,392 KB
testcase_14 AC 185 ms
11,904 KB
testcase_15 AC 189 ms
11,904 KB
testcase_16 AC 185 ms
12,288 KB
testcase_17 AC 193 ms
15,232 KB
testcase_18 AC 212 ms
15,872 KB
testcase_19 AC 212 ms
15,872 KB
testcase_20 AC 227 ms
16,256 KB
testcase_21 AC 221 ms
15,872 KB
testcase_22 AC 216 ms
15,872 KB
testcase_23 AC 226 ms
16,384 KB
testcase_24 AC 218 ms
15,872 KB
testcase_25 AC 216 ms
15,872 KB
testcase_26 AC 227 ms
16,512 KB
testcase_27 AC 221 ms
15,872 KB
testcase_28 AC 222 ms
15,872 KB
testcase_29 AC 223 ms
16,384 KB
testcase_30 AC 236 ms
15,872 KB
testcase_31 AC 235 ms
15,872 KB
testcase_32 AC 230 ms
16,384 KB
testcase_33 AC 1 ms
6,944 KB
testcase_34 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> 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: methods `find_closed` and `get` are never used
  --> main.rs:27:8
   |
11 | / impl<F, T> SegmentTree<F, T> where
12 | | T: std::fmt::Debug + Clone,
13 | | F: Fn(&T, &T) -> T
   | |__________________- methods in this implementation
...
27 |       fn find_closed(&self, l: usize, r: usize) -> T {
   |          ^^^^^^^^^^^
...
44 |       fn get(&mut self, pos: usize) -> &T {
   |          ^^^

warning: variable `UNIT` should have a snake case name
  --> 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

warning: 3 warnings emitted

ソースコード

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 = |x: &Vec<usize>, y: &Vec<usize>| {
        let n = x.len();
        let mut ret = vec![0usize; n];
        for i in 0..n {
            ret[i] = y[x[i]];
        }
        ret
    };
    let mut segtree = SegmentTree::new(m, UNIT, operator);
    for v in queries.iter() {
        let t = v[0];
        match t {
            1 => {
                let d = v[1]-1;
                let p = (2..n+2).map(|i| v[i]-1).collect::<Vec<_>>();
                segtree.set(d, p);
            },
            2 => {
                let s = v[1];
                let orders = segtree.find(0, s);
                let mut result = vec![0usize; n];
                for i in 0..n {
                    result[orders[i]] = i+1;
                }
                println!("{}", result.iter().map(|&v| v.to_string()).collect::<Vec<_>>().join(" "));
            },
            3 => {
                let l = v[1]-1;
                let r = v[2];
                let orders = segtree.find(l, r);
                println!("{}", orders.iter().enumerate().map(|(i, &v)| i.max(v) - i.min(v)).sum::<usize>());
            },
            _ => { unreachable!(); }
        }
    }
}
0