結果
問題 | No.1996 <>< |
ユーザー | phspls |
提出日時 | 2022-09-22 02:31:41 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 398 ms / 2,000 ms |
コード長 | 2,989 bytes |
コンパイル時間 | 2,827 ms |
コンパイル使用メモリ | 170,524 KB |
実行使用メモリ | 19,620 KB |
最終ジャッジ日時 | 2023-08-23 20:19:45 |
合計ジャッジ時間 | 8,539 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 184 ms
10,884 KB |
testcase_12 | AC | 370 ms
19,620 KB |
testcase_13 | AC | 398 ms
19,576 KB |
testcase_14 | AC | 378 ms
19,104 KB |
testcase_15 | AC | 336 ms
16,776 KB |
testcase_16 | AC | 277 ms
14,964 KB |
testcase_17 | AC | 337 ms
16,676 KB |
testcase_18 | AC | 192 ms
10,604 KB |
testcase_19 | AC | 232 ms
12,324 KB |
testcase_20 | AC | 227 ms
11,608 KB |
testcase_21 | AC | 294 ms
14,852 KB |
testcase_22 | AC | 343 ms
17,244 KB |
testcase_23 | AC | 12 ms
4,380 KB |
testcase_24 | AC | 188 ms
10,616 KB |
testcase_25 | AC | 90 ms
6,420 KB |
testcase_26 | AC | 158 ms
9,024 KB |
testcase_27 | AC | 31 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,376 KB |
testcase_29 | AC | 84 ms
5,852 KB |
testcase_30 | AC | 5 ms
4,376 KB |
testcase_31 | AC | 35 ms
4,380 KB |
testcase_32 | AC | 2 ms
4,380 KB |
コンパイルメッセージ
warning: field `orgn` is never read --> 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: associated function `find_closed` is never used --> Main.rs:31:8 | 31 | fn find_closed(&self, l: usize, r: usize) -> T { | ^^^^^^^^^^^ warning: 2 warnings emitted
ソースコード
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 mut 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<usize>>(); let mut mapping = HashMap::new(); for (i, &v) in aset.iter().enumerate() { mapping.insert(v, i); } for i in 0..n { a[i] = *mapping.get(&a[i]).unwrap(); } let mut dp = vec![vec![0usize; n]; k+1]; dp[0] = vec![1usize; n]; for i in 0..k { let mut segtree = SegmentTree::new(aset.len(), 0usize, |x, y| x + y); for j in 0..n { dp[i+1][j] = if s[i] == '<' { segtree.find(0, a[j]) } else { segtree.find(a[j]+1, aset.len()) } % MOD; let val = segtree.get(a[j]); segtree.set(a[j], (val+dp[i][j])%MOD); } } println!("{}", dp[k].iter().sum::<usize>() % MOD); }