結果
問題 | No.1868 Teleporting Cyanmond |
ユーザー |
|
提出日時 | 2022-09-25 15:41:11 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 40 ms / 2,000 ms |
コード長 | 2,292 bytes |
コンパイル時間 | 14,357 ms |
コンパイル使用メモリ | 379,484 KB |
実行使用メモリ | 6,144 KB |
最終ジャッジ日時 | 2024-12-22 12:59:24 |
合計ジャッジ時間 | 14,210 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
コンパイルメッセージ
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 { | ^^^
ソースコード
const INF: usize = 1usize << 60; #[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 n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); let mut r = String::new(); std::io::stdin().read_line(&mut r).ok(); let r: Vec<usize> = r.trim().split_whitespace().map(|s| s.parse::<usize>().unwrap()-1).collect(); let mut dp = vec![INF; n]; let mut segtree = SegmentTree::new(n, INF, |x, y| x.min(y)); dp[n-1] = 0; segtree.set(n-1, 0); for i in (0..n-1).rev() { dp[i] = 1 + segtree.find_closed(i+1, r[i]); segtree.set(i, dp[i]); } println!("{}", dp[0]); }