結果

問題 No.1996 <><
ユーザー phsplsphspls
提出日時 2022-10-18 11:59:00
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 273 ms / 2,000 ms
コード長 2,876 bytes
コンパイル時間 13,688 ms
コンパイル使用メモリ 379,688 KB
実行使用メモリ 19,712 KB
最終ジャッジ日時 2024-06-28 20:44:42
合計ジャッジ時間 17,968 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 0 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 0 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 114 ms
10,880 KB
testcase_12 AC 227 ms
19,712 KB
testcase_13 AC 273 ms
19,712 KB
testcase_14 AC 264 ms
19,200 KB
testcase_15 AC 227 ms
16,640 KB
testcase_16 AC 196 ms
14,720 KB
testcase_17 AC 225 ms
16,768 KB
testcase_18 AC 133 ms
10,624 KB
testcase_19 AC 159 ms
12,160 KB
testcase_20 AC 151 ms
11,520 KB
testcase_21 AC 198 ms
14,848 KB
testcase_22 AC 239 ms
17,152 KB
testcase_23 AC 9 ms
5,376 KB
testcase_24 AC 128 ms
10,496 KB
testcase_25 AC 62 ms
6,400 KB
testcase_26 AC 108 ms
8,960 KB
testcase_27 AC 21 ms
5,376 KB
testcase_28 AC 1 ms
5,376 KB
testcase_29 AC 58 ms
5,888 KB
testcase_30 AC 3 ms
5,376 KB
testcase_31 AC 24 ms
5,376 KB
testcase_32 AC 1 ms
5,376 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: methods `find_closed` and `get` are 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
   | |________________- methods in this implementation
...
31 |       fn find_closed(&self, l: usize, r: usize) -> T {
   |          ^^^^^^^^^^^
...
48 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff # 

use std::cmp::Reverse;


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 mut dp = vec![vec![0usize; n]; k+1];
    dp[0] = vec![1usize; n];
    let mut orders = (0..n).collect::<Vec<_>>();
    orders.sort_by_key(|&i| (a[i], Reverse(i)));
    let mut revorders = (0..n).collect::<Vec<_>>();
    revorders.sort_by_key(|&i| (Reverse(a[i]), Reverse(i)));
    for i in 0..k {
        let mut segtree = SegmentTree::new(n, 0usize, |x, y| x + y);
        let iter = if s[i] == '<' { orders.iter() } else { revorders.iter() };
        for &j in iter {
            dp[i+1][j] = segtree.find(0, j) % MOD;
            segtree.set(j, dp[i][j]);
        }
    }
    println!("{}", dp[k].iter().sum::<usize>() % MOD);
}
0