結果
問題 | No.1435 Mmm...... |
ユーザー | phspls |
提出日時 | 2022-11-07 01:46:24 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 387 ms / 2,000 ms |
コード長 | 2,769 bytes |
コンパイル時間 | 3,857 ms |
コンパイル使用メモリ | 155,272 KB |
実行使用メモリ | 17,704 KB |
最終ジャッジ日時 | 2023-09-27 17:47:14 |
合計ジャッジ時間 | 14,854 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 273 ms
15,752 KB |
testcase_07 | AC | 321 ms
16,132 KB |
testcase_08 | AC | 357 ms
16,484 KB |
testcase_09 | AC | 329 ms
16,440 KB |
testcase_10 | AC | 280 ms
16,084 KB |
testcase_11 | AC | 282 ms
16,072 KB |
testcase_12 | AC | 266 ms
15,932 KB |
testcase_13 | AC | 261 ms
15,764 KB |
testcase_14 | AC | 183 ms
9,224 KB |
testcase_15 | AC | 382 ms
16,524 KB |
testcase_16 | AC | 317 ms
16,136 KB |
testcase_17 | AC | 205 ms
9,544 KB |
testcase_18 | AC | 373 ms
16,420 KB |
testcase_19 | AC | 275 ms
16,040 KB |
testcase_20 | AC | 345 ms
16,468 KB |
testcase_21 | AC | 278 ms
17,536 KB |
testcase_22 | AC | 362 ms
16,164 KB |
testcase_23 | AC | 387 ms
17,700 KB |
testcase_24 | AC | 384 ms
17,652 KB |
testcase_25 | AC | 386 ms
17,684 KB |
testcase_26 | AC | 385 ms
17,704 KB |
testcase_27 | AC | 386 ms
17,620 KB |
コンパイルメッセージ
warning: field `orgn` is never read --> 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: associated function `find_closed` is never used --> Main.rs:29:8 | 29 | fn find_closed(&self, l: usize, r: usize) -> T { | ^^^^^^^^^^^ warning: associated function `get` is never used --> Main.rs:46:8 | 46 | fn get(&mut self, pos: usize) -> T { | ^^^ warning: 3 warnings emitted
ソースコード
const INF: isize = 1isize << 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 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 operator = |(lmax, lmin1, lmin2): (isize, isize, isize), (rmax, rmin1, rmin2): (isize, isize, isize)| { let maxval = lmax.max(rmax); let mut mins = vec![lmin1, lmin2, rmin1, rmin2]; mins.sort(); let min1 = mins[0]; let min2 = mins[1]; (maxval, min1, min2) }; let mut segtree = SegmentTree::new(n, (-INF, INF, INF), operator); for i in 0..n { segtree.set(i, (a[i], a[i], INF)); } let mut result = 0usize; let mut idx = n; for i in (0..n).rev() { while idx - i >= 2 { let (maxval, min1, min2) = segtree.find(i, idx); if maxval <= min1 + min2 { break; } idx -= 1; } result += idx - i - 1; } println!("{}", result); }