結果
問題 | No.2065 Sum of Min |
ユーザー | phspls |
提出日時 | 2022-09-30 18:09:21 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 273 ms / 2,000 ms |
コード長 | 3,172 bytes |
コンパイル時間 | 3,583 ms |
コンパイル使用メモリ | 153,108 KB |
実行使用メモリ | 12,492 KB |
最終ジャッジ日時 | 2023-08-24 05:24:24 |
合計ジャッジ時間 | 11,565 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 200 ms
11,876 KB |
testcase_05 | AC | 195 ms
11,872 KB |
testcase_06 | AC | 245 ms
11,512 KB |
testcase_07 | AC | 183 ms
12,492 KB |
testcase_08 | AC | 254 ms
12,336 KB |
testcase_09 | AC | 229 ms
12,280 KB |
testcase_10 | AC | 212 ms
12,216 KB |
testcase_11 | AC | 212 ms
12,172 KB |
testcase_12 | AC | 268 ms
12,100 KB |
testcase_13 | AC | 261 ms
12,248 KB |
testcase_14 | AC | 270 ms
12,172 KB |
testcase_15 | AC | 267 ms
12,236 KB |
testcase_16 | AC | 273 ms
12,236 KB |
testcase_17 | AC | 273 ms
12,168 KB |
testcase_18 | AC | 264 ms
12,188 KB |
testcase_19 | AC | 262 ms
12,216 KB |
testcase_20 | AC | 270 ms
12,252 KB |
testcase_21 | AC | 260 ms
12,152 KB |
コンパイルメッセージ
warning: unused imports: `BTreeSet`, `HashSet` --> Main.rs:1:24 | 1 | use std::collections::{HashSet, BTreeSet}; | ^^^^^^^ ^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: variable does not need to be mutable --> Main.rs:79:9 | 79 | let mut a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default 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: 5 warnings emitted
ソースコード
use std::collections::{HashSet, BTreeSet}; #[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 nq = String::new(); std::io::stdin().read_line(&mut nq).ok(); let nq: Vec<usize> = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nq[0]; let q = nq[1]; let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let mut a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut queries = (0..q).map(|i| { 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[0]-1, temp[1], temp[2], i) }) .collect::<Vec<_>>(); let mut a = (0..n).map(|i| (a[i], i)).collect::<Vec<(usize, usize)>>(); a.sort_by_key(|&(v, _)| v); let mut result = vec![0usize; q]; let mut val_segtree = SegmentTree::new(n, 0usize, |x, y| x + y); let mut cnt_segtree = SegmentTree::new(n, 0usize, |x, y| x + y); queries.sort_by_key(|&(_, _, x, _)| x); let mut idx = 0usize; for &(l, r, x, qidx) in queries.iter() { while idx < n && a[idx].0 <= x { let (aval, aidx) = a[idx]; val_segtree.set(aidx, aval); cnt_segtree.set(aidx, 1); idx += 1; } result[qidx] = val_segtree.find(l, r) + (r - l - cnt_segtree.find(l, r)) * x; } for &v in result.iter() { println!("{}", v); } }