結果
問題 | No.1996 <>< |
ユーザー | phspls |
提出日時 | 2022-10-04 11:10:11 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 730 ms / 2,000 ms |
コード長 | 3,089 bytes |
コンパイル時間 | 15,176 ms |
コンパイル使用メモリ | 387,580 KB |
実行使用メモリ | 50,048 KB |
最終ジャッジ日時 | 2024-06-09 10:11:29 |
合計ジャッジ時間 | 22,169 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 0 ms
6,940 KB |
testcase_03 | AC | 0 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 347 ms
25,984 KB |
testcase_12 | AC | 718 ms
50,048 KB |
testcase_13 | AC | 730 ms
50,048 KB |
testcase_14 | AC | 698 ms
48,512 KB |
testcase_15 | AC | 589 ms
43,776 KB |
testcase_16 | AC | 487 ms
38,400 KB |
testcase_17 | AC | 621 ms
44,544 KB |
testcase_18 | AC | 322 ms
28,928 KB |
testcase_19 | AC | 376 ms
31,104 KB |
testcase_20 | AC | 384 ms
28,672 KB |
testcase_21 | AC | 534 ms
40,192 KB |
testcase_22 | AC | 617 ms
43,520 KB |
testcase_23 | AC | 15 ms
6,940 KB |
testcase_24 | AC | 306 ms
31,744 KB |
testcase_25 | AC | 120 ms
12,672 KB |
testcase_26 | AC | 257 ms
24,448 KB |
testcase_27 | AC | 35 ms
6,944 KB |
testcase_28 | AC | 1 ms
6,944 KB |
testcase_29 | AC | 119 ms
10,496 KB |
testcase_30 | AC | 5 ms
6,940 KB |
testcase_31 | AC | 43 ms
8,064 KB |
testcase_32 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
warning: field `orgn` is never read --> src/main.rs:9:5 | 7 | struct SegmentTree<F, T> { | ----------- field in this struct 8 | n: usize, 9 | 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 `find_closed` is never used --> src/main.rs:31:8 | 15 | / impl<F, T> SegmentTree<F, T> where 16 | | T: std::fmt::Debug + Copy, 17 | | F: Fn(T, T) -> T | |________________- method in this implementation ... 31 | fn find_closed(&self, l: usize, r: usize) -> T { | ^^^^^^^^^^^
ソースコード
use std::collections::{BTreeSet, HashMap}; const MOD: usize = 1e9 as usize + 7; #[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 nk = String::new(); std::io::stdin().read_line(&mut nk).ok(); let nk: Vec<usize> = nk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nk[0]; let k = nk[1]; let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); let s = s.trim().chars().collect::<Vec<_>>(); let aset = a.iter().copied().collect::<BTreeSet<_>>(); let mut mapping = HashMap::new(); for (i, &v) in aset.iter().enumerate() { mapping.insert(v, i); } let a = a.into_iter().map(|i| *mapping.get(&i).unwrap()).collect::<Vec<_>>(); let mut segtrees = vec![SegmentTree::new(aset.len(), 0usize, |x, y| (x + y) % MOD); k+1]; for i in 0..n { let val = segtrees[0].get(a[i]); segtrees[0].set(a[i], val+1); for j in 0..k { let val = if s[j] == '<' { segtrees[j].find(0, a[i]) } else { segtrees[j].find(a[i]+1, aset.len()) }; let cur = segtrees[j+1].get(a[i]); segtrees[j+1].set(a[i], (cur+val)%MOD); } } println!("{}", segtrees[k].find(0, aset.len())); }