#471138 (Rust) No.1031 いたずら好きなお姉ちゃん

• 問題: No.1031 いたずら好きなお姉ちゃん
• ユーザー: koba-e964
• 提出日時: 2020-04-26 03:01:57
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 78 ms / 3,500 ms
• コード長: 5,790 bytes
• コンパイル時間: 3,420 ms
• コンパイル使用メモリ: 183,624 KB
• 実行使用メモリ: 19,968 KB
• 最終ジャッジ日時: 2024-04-26 07:10:34
• 合計ジャッジ時間: 7,764 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	3 ms; 6,940 KB
testcase_04	AC	3 ms; 6,944 KB
testcase_05	AC	3 ms; 6,944 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	3 ms; 6,940 KB
testcase_08	AC	3 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	AC	55 ms; 15,360 KB
testcase_12	AC	56 ms; 15,360 KB
testcase_13	AC	68 ms; 18,304 KB
testcase_14	AC	56 ms; 16,000 KB
testcase_15	AC	63 ms; 17,280 KB
testcase_16	AC	53 ms; 15,232 KB
testcase_17	AC	65 ms; 17,280 KB
testcase_18	AC	59 ms; 16,768 KB
testcase_19	AC	63 ms; 17,536 KB
testcase_20	AC	66 ms; 18,432 KB
testcase_21	AC	59 ms; 16,768 KB
testcase_22	AC	53 ms; 15,232 KB
testcase_23	AC	55 ms; 15,616 KB
testcase_24	AC	64 ms; 17,536 KB
testcase_25	AC	65 ms; 18,176 KB
testcase_26	AC	62 ms; 17,024 KB
testcase_27	AC	59 ms; 16,000 KB
testcase_28	AC	69 ms; 18,304 KB
testcase_29	AC	70 ms; 18,432 KB
testcase_30	AC	69 ms; 18,176 KB
testcase_31	AC	70 ms; 18,432 KB
testcase_32	AC	70 ms; 18,304 KB
testcase_33	AC	70 ms; 18,304 KB
testcase_34	AC	78 ms; 19,968 KB
testcase_35	AC	77 ms; 18,816 KB
testcase_36	AC	78 ms; 19,072 KB
testcase_37	AC	77 ms; 19,328 KB
testcase_38	AC	74 ms; 18,432 KB
testcase_39	AC	72 ms; 18,176 KB
testcase_40	AC	72 ms; 18,176 KB
testcase_41	AC	72 ms; 18,560 KB
testcase_42	AC	75 ms; 18,432 KB
testcase_43	AC	71 ms; 18,304 KB
testcase_44	AC	71 ms; 18,048 KB
testcase_45	AC	67 ms; 17,664 KB
testcase_46	AC	75 ms; 18,944 KB
testcase_47	AC	73 ms; 18,432 KB
testcase_48	AC	75 ms; 19,200 KB
testcase_49	AC	76 ms; 18,816 KB
testcase_50	AC	76 ms; 18,944 KB
testcase_51	AC	75 ms; 19,072 KB
testcase_52	AC	75 ms; 19,200 KB
testcase_53	AC	74 ms; 19,328 KB
testcase_54	AC	1 ms; 6,940 KB
testcase_55	AC	1 ms; 6,940 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());
}

/**
 * Sparse Table.
 * BiOp should be the type of a binary operator which is
 * associative, commutative and idempotent.
 * (For example, both min and gcd satisfy these properties.)
 * Verified by: AtCoder CODE FESTIVAL 2016 Tournament Round 3 (Parallel) B
 * (http://cf16-tournament-round3-open.contest.atcoder.jp/submissions/1026294)
 */
struct SparseTable<T, BiOp> {
    biop: BiOp,
    st: Vec<Vec<T>>,
}

impl<T, BiOp> SparseTable<T, BiOp>
    where BiOp: Fn(T, T) -> T,
          T: Copy {
    pub fn new(ary: &[T], biop: BiOp) -> Self {
        let n = ary.len();
        let mut h = 1;
        while 1 << h < n {
            h += 1;
        }
        let mut st: Vec<Vec<T>> = vec![Vec::from(ary); h + 1];
        for i in 0 .. n {
            st[0][i] = ary[i];
        }
        for b in 1 .. (h + 1) {
            if n + 1 < 1 << b {
                break;
            }
            for i in 0 .. (n + 1 - (1 << b)) {
                let next_idx = (1 << (b - 1)) + i;
                st[b][i] = biop(st[b - 1][i], st[b - 1][next_idx]);
            }
        }
        SparseTable {biop: biop, st: st}
    }
    fn top_bit(t: usize) -> usize {
        let mut h = 0;
        while 1 << h <= t {
            h += 1;
        }
        h - 1
    }
    pub fn query(&self, f: usize, s: usize) -> T {
        assert!(f <= s);
        let b = Self::top_bit(s + 1 - f);
        let endpoint = s + 1 - (1 << b);
        (self.biop)(self.st[b][f], self.st[b][endpoint])
    }
}

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,
        p: [usize; n],
    }
    let mut tot = 0i64;
    let spt = SparseTable::new(&p, min);
    let mut lohi = vec![(0, 0); n];
    for i in 0..n {
        let mut fail = n;
        let mut pass = i;
        while fail - pass > 1 {
            let mid = (pass + fail) / 2;
            if spt.query(i, mid) < p[i] {
                fail = mid;
            } else {
                pass = mid;
            }
        }
        let hi = pass;
        // bias: -1
        fail = 0;
        pass = i + 1;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if spt.query(mid - 1, i) < p[i] {
                fail = mid;
            } else {
                pass = mid;
            }
        }
        let lo = pass - 1;
        lohi[i] = (lo, hi);
    }
    let mut st: Vec<(usize, usize)> = vec![];
    // left -> right
    for i in 0..n {
        let lo = lohi[i].0;
        while let Some(x) = st.pop() {
            if x.0 > p[i] {
                st.push(x);
                break;
            }
        }
        // binsect bias = -1
        let mut pass = st.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if st[mid - 1].1 >= lo {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        tot += (st.len() + 1 - pass) as i64;
        st.push((p[i], i));
    }
    // right -> left
    st.clear();
    for i in (0..n).rev() {
        let hi = lohi[i].1;
        while let Some(x) = st.pop() {
            if x.0 > p[i] {
                st.push(x);
                break;
            }
        }
        // binsect bias = -1
        let mut pass = st.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if st[mid - 1].1 <= hi {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        tot += (st.len() + 1 - pass) as i64;
        st.push((p[i], i));
    }
    
    puts!("{}\n", tot);
}

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