結果
問題 | No.1234 典型RMQ |
ユーザー | phspls |
提出日時 | 2022-11-11 11:05:42 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 234 ms / 2,000 ms |
コード長 | 4,369 bytes |
コンパイル時間 | 1,161 ms |
コンパイル使用メモリ | 153,156 KB |
実行使用メモリ | 10,560 KB |
最終ジャッジ日時 | 2023-10-11 07:21:57 |
合計ジャッジ時間 | 10,445 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 217 ms
9,648 KB |
testcase_07 | AC | 169 ms
5,780 KB |
testcase_08 | AC | 231 ms
10,560 KB |
testcase_09 | AC | 200 ms
7,940 KB |
testcase_10 | AC | 227 ms
10,136 KB |
testcase_11 | AC | 219 ms
9,416 KB |
testcase_12 | AC | 197 ms
7,640 KB |
testcase_13 | AC | 169 ms
5,824 KB |
testcase_14 | AC | 198 ms
7,624 KB |
testcase_15 | AC | 192 ms
7,468 KB |
testcase_16 | AC | 224 ms
9,964 KB |
testcase_17 | AC | 204 ms
7,620 KB |
testcase_18 | AC | 158 ms
5,376 KB |
testcase_19 | AC | 234 ms
10,320 KB |
testcase_20 | AC | 158 ms
10,056 KB |
testcase_21 | AC | 219 ms
9,700 KB |
testcase_22 | AC | 182 ms
10,128 KB |
testcase_23 | AC | 181 ms
10,104 KB |
testcase_24 | AC | 182 ms
10,076 KB |
testcase_25 | AC | 182 ms
9,940 KB |
testcase_26 | AC | 185 ms
10,268 KB |
testcase_27 | AC | 1 ms
4,352 KB |
testcase_28 | AC | 1 ms
4,356 KB |
testcase_29 | AC | 1 ms
4,352 KB |
コンパイルメッセージ
warning: field `orgn` is never read --> Main.rs:7:5 | 5 | struct LazySegmentTree<F, G, H, T, U> { | --------------- field in this struct 6 | n: usize, 7 | orgn: usize, | ^^^^ | = note: `LazySegmentTree` 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: associated function `get` is never used --> Main.rs:56:8 | 56 | fn get(&mut self, pos: usize) -> T { | ^^^ warning: 2 warnings emitted
ソースコード
const INF: isize = 1isize << 60; #[derive(Debug, Clone)] struct LazySegmentTree<F, G, H, T, U> { n: usize, orgn: usize, unit: T, mem: Vec<T>, lazy_unit: U, lazy: Vec<U>, operator: F, mapper: G, composer: H, } impl<F, G, H, T, U> LazySegmentTree<F, G, H, T, U> where T: std::fmt::Debug + Copy, U: std::fmt::Debug + std::cmp::PartialEq + Copy, F: Fn(T, T) -> T, G: Fn(T, U) -> T, H: Fn(U, U) -> U, { fn new(n: usize, unit: T, lazy_unit: U, operator: F, mapper: G, composer: H) -> Self { let mut size = 1usize; while size < n { size *= 2; } Self { n: size, orgn: n, unit: unit, mem: vec![unit; size*2-1], lazy_unit: lazy_unit, lazy: vec![lazy_unit; size*2-1], operator: operator, mapper: mapper, composer: composer, } } fn find_closed(&mut self, l: usize, r: usize) -> T { self.find(l, r+1) } fn find(&mut self, l: usize, r: usize) -> T { self._find(l, r, 0, 0, self.n) } fn update_closed(&mut self, left: usize, right: usize, val: U) { self.update(left, right+1, val); } fn update(&mut self, left: usize, right: usize, val: U) { self._update(left, right, val, 0, 0, self.n); } fn get(&mut self, pos: usize) -> T { self.find_closed(pos, pos) } fn _evaluate(&mut self, k: usize) { if self.lazy[k] == self.lazy_unit { return; } if k < self.n-1 { let left = self._left(k); let right = self._right(k); self.lazy[left] = (self.composer)(self.lazy[left], self.lazy[k]); self.lazy[right] = (self.composer)(self.lazy[right], self.lazy[k]); } self.mem[k] = (self.mapper)(self.mem[k], self.lazy[k]); self.lazy[k] = self.lazy_unit; } fn _find(&mut self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T { self._evaluate(nodenum); if r <= a || b <= l { self.unit } else if a <= l && r <= b { self.mem[nodenum] } else { 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 _update(&mut self, a: usize, b: usize, x: U, nodenum: usize, l: usize, r: usize) { self._evaluate(nodenum); if a <= l && r <= b { self.lazy[nodenum] = (self.composer)(self.lazy[nodenum], x); self._evaluate(nodenum); } else if a < r && l < b { self._update(a, b, x, self._left(nodenum), l, (l + r) / 2); self._update(a, b, x, self._right(nodenum), (l + r) / 2, r); self.mem[nodenum] = (self.operator)(self.mem[self._left(nodenum)], self.mem[self._right(nodenum)]); } } 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 n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); 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 mut q = String::new(); std::io::stdin().read_line(&mut q).ok(); let q: usize = q.trim().parse().unwrap(); let queries = (0..q).map(|_| { let mut temp = String::new(); std::io::stdin().read_line(&mut temp).ok(); let temp: Vec<isize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); (temp[0], temp[1] as usize - 1, temp[2] as usize - 1, temp[3]) }) .collect::<Vec<_>>(); let operator = |x: isize, y: isize| x.min(y); let mapper = |x, y| if x == INF { y } else { x+y }; let composer = |x, y| x+y; let mut segtree = LazySegmentTree::new(n, INF, 0isize, operator, mapper, composer); for i in 0..n { segtree.update_closed(i, i, a[i]); } for &(k, l, r, c) in queries.iter() { if k == 1 { segtree.update_closed(l, r, c); } else { println!("{}", segtree.find_closed(l, r)); } } }