結果

問題 No.1996 <><
コンテスト
ユーザー phspls
提出日時 2022-10-04 11:10:11
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 872 ms / 2,000 ms
コード長 3,089 bytes
コンパイル時間 18,621 ms
コンパイル使用メモリ 378,492 KB
実行使用メモリ 50,176 KB
最終ジャッジ日時 2024-12-29 17:11:45
合計ジャッジ時間 26,272 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 {
   |          ^^^^^^^^^^^

ソースコード

diff # 

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()));
}
0