#437277 (Rust) No.992 最長増加部分列の数え上げ

• 問題: No.992 最長増加部分列の数え上げ
• ユーザー: koba-e964
• 提出日時: 2020-03-03 02:36:32
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 152 ms / 2,000 ms
• コード長: 10,046 bytes
• コンパイル時間: 14,598 ms
• コンパイル使用メモリ: 378,172 KB
• 実行使用メモリ: 16,384 KB
• 最終ジャッジ日時: 2024-10-13 21:39:17
• 合計ジャッジ時間: 20,547 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 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,248 KB
testcase_04	AC	48 ms; 7,296 KB
testcase_05	AC	34 ms; 5,504 KB
testcase_06	AC	59 ms; 8,192 KB
testcase_07	AC	42 ms; 7,168 KB
testcase_08	AC	22 ms; 5,248 KB
testcase_09	AC	47 ms; 7,040 KB
testcase_10	AC	64 ms; 8,064 KB
testcase_11	AC	82 ms; 9,216 KB
testcase_12	AC	15 ms; 5,248 KB
testcase_13	AC	43 ms; 6,912 KB
testcase_14	AC	44 ms; 7,040 KB
testcase_15	AC	16 ms; 5,248 KB
testcase_16	AC	134 ms; 14,080 KB
testcase_17	AC	23 ms; 5,248 KB
testcase_18	AC	44 ms; 6,784 KB
testcase_19	AC	83 ms; 9,088 KB
testcase_20	AC	152 ms; 14,848 KB
testcase_21	AC	151 ms; 14,848 KB
testcase_22	AC	138 ms; 14,848 KB
testcase_23	AC	136 ms; 14,848 KB
testcase_24	AC	136 ms; 14,848 KB
testcase_25	AC	135 ms; 14,976 KB
testcase_26	AC	134 ms; 14,848 KB
testcase_27	AC	137 ms; 14,848 KB
testcase_28	AC	137 ms; 14,848 KB
testcase_29	AC	140 ms; 14,848 KB
testcase_30	AC	78 ms; 16,256 KB
testcase_31	AC	78 ms; 16,384 KB
testcase_32	AC	78 ms; 16,256 KB
testcase_33	AC	78 ms; 16,384 KB
testcase_34	AC	78 ms; 16,256 KB
testcase_35	AC	67 ms; 15,488 KB
testcase_36	AC	67 ms; 15,488 KB
testcase_37	AC	66 ms; 15,488 KB
testcase_38	AC	66 ms; 15,616 KB
testcase_39	AC	65 ms; 15,488 KB
testcase_40	AC	86 ms; 15,488 KB
testcase_41	AC	86 ms; 15,488 KB
testcase_42	AC	87 ms; 15,488 KB
testcase_43	AC	87 ms; 15,488 KB
testcase_44	AC	86 ms; 15,488 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
mod mod_int {
    use std::ops::*;
    pub trait Mod: Copy { fn m() -> i64; }
    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
    impl<M: Mod> ModInt<M> {
        // x >= 0
        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
        fn new_internal(x: i64) -> Self {
            ModInt { x: x, phantom: ::std::marker::PhantomData }
        }
        pub fn pow(self, mut e: i64) -> Self {
            debug_assert!(e >= 0);
            let mut sum = ModInt::new_internal(1);
            let mut cur = self;
            while e > 0 {
                if e % 2 != 0 { sum *= cur; }
                cur *= cur;
                e /= 2;
            }
            sum
        }
        #[allow(dead_code)]
        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x + other.x;
            if sum >= M::m() { sum -= M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x - other.x;
            if sum < 0 { sum += M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
        fn add_assign(&mut self, other: T) { *self = *self + other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
        fn sub_assign(&mut self, other: T) { *self = *self - other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
        fn mul_assign(&mut self, other: T) { *self = *self * other; }
    }
    impl<M: Mod> Neg for ModInt<M> {
        type Output = Self;
        fn neg(self) -> Self { ModInt::new(0) - self }
    }
    impl<M> ::std::fmt::Display for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_rules! define_mod {
    ($struct_name: ident, $modulo: expr) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
        struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 1_000_000_007;
define_mod!(P, MOD);
type ModInt = mod_int::ModInt<P>;

/**
 * Segment Tree. This data structure is useful for fast folding on intervals of an array
 * whose elements are elements of monoid I. Note that constructing this tree requires the identity
 * element of I and the operation of I.
 * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 */
struct SegTree<I, BiOp> {
    n: usize,
    dat: Vec<I>,
    op: BiOp,
    e: I,
}

impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    pub fn new(n_: usize, op: BiOp, e: I) -> Self {
        let mut n = 1;
        while n < n_ { n *= 2; } // n is a power of 2
        SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        let mut k = idx + self.n - 1;
        self.dat[k] = v;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        let mut left = self.e;
        let mut right = self.e;
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a]);
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1], right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize,
        a: [i64; n],
    }
    let mut coord = a.clone();
    coord.sort_unstable();
    coord.dedup();
    let m = coord.len();
    let a: Vec<usize> = a.into_iter()
        .map(|v| coord.binary_search(&v).unwrap() + 1)
        .collect();
    let mut tbl = vec![0];
    let mut l = 0;
    let mut dp = vec![0; n];
    for i in 0..n {
        let idx = tbl.lower_bound(&a[i]);
        assert!(idx > 0);
        l = max(l, idx);
        while tbl.len() <= l {
            tbl.push(m + 1);
        }
        assert!(tbl[idx] >= a[i]);
        tbl[idx] = a[i];
        dp[i] = idx;
    }
    let mut dpocc = vec![vec![]; l + 1];
    for i in 0..n {
        dpocc[dp[i]].push(i);
    }
    let mut st = SegTree::new(m + 1, |x, y| x + y, ModInt::new(0));
    let mut ep = vec![ModInt::new(0); n];
    for &idx in &dpocc[1] {
        ep[idx] = 1.into();
    }
    for i in 1..l {
        // i -> i + 1
        let mut ind = dpocc[i].clone();
        ind.extend_from_slice(&dpocc[i + 1]);
        ind.sort();
        for &idx in &ind {
            if dp[idx] == i {
                let val = st.query(a[idx], a[idx] + 1);
                st.update(a[idx], val + ep[idx]);
            } else {
                ep[idx] = st.query(0, a[idx]);
            }
        }
        for &idx in &ind {
            if dp[idx] == i {
                st.update(a[idx], 0.into());
            }
        }
    }
    let mut ans = ModInt::new(0);
    for i in 0..n {
        if dp[i] == l {
            ans += ep[i];
        }
    }
    puts!("{}\n", ans);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}