#503187 (Rust) No.1095 Smallest Kadomatsu Subsequence

• 問題: No.1095 Smallest Kadomatsu Subsequence
• ユーザー: ziita
• 提出日時: 2020-06-26 21:55:13
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 283 ms / 2,000 ms
• コード長: 4,343 bytes
• コンパイル時間: 14,290 ms
• コンパイル使用メモリ: 378,832 KB
• 実行使用メモリ: 10,792 KB
• 最終ジャッジ日時: 2024-07-04 20:57:52
• 合計ジャッジ時間: 16,687 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,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 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	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	12 ms; 5,376 KB
testcase_14	AC	11 ms; 5,376 KB
testcase_15	AC	11 ms; 5,376 KB
testcase_16	AC	11 ms; 5,376 KB
testcase_17	AC	10 ms; 5,376 KB
testcase_18	AC	11 ms; 5,376 KB
testcase_19	AC	11 ms; 5,376 KB
testcase_20	AC	11 ms; 5,376 KB
testcase_21	AC	10 ms; 5,376 KB
testcase_22	AC	11 ms; 5,376 KB
testcase_23	AC	283 ms; 9,616 KB
testcase_24	AC	277 ms; 9,528 KB
testcase_25	AC	274 ms; 9,512 KB
testcase_26	AC	271 ms; 9,640 KB
testcase_27	AC	283 ms; 9,516 KB
testcase_28	AC	162 ms; 10,788 KB
testcase_29	AC	138 ms; 10,792 KB
testcase_30	AC	204 ms; 10,284 KB
testcase_31	AC	208 ms; 10,280 KB
testcase_32	AC	216 ms; 10,280 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
const INF: i64 = std::i64::MAX/3;

use std::ops::Bound::Included;

fn solve() {
    let n = read!(usize);
    let a = read!([i64]);
    let mut left: BTreeSet<(i64,usize)> = BTreeSet::new();
    let mut right: BTreeSet<(i64,usize)> = BTreeSet::new();
    for i in 0..n {
        right.insert((a[i],i));
    }
    let mut ans = INF;
    for i in 0..n {
        right.remove(&(a[i],i));
        if i>0&&i<n-1 {
            let mut lmax = vec![];
            let mut rmax = vec![];
            for j in left.range(((Included(&(a[i],0)), Included(&(INF,n))))).take(3) {
                lmax.push(j);
            }
            for j in right.range(((Included(&(a[i],0)), Included(&(INF,n))))).take(3) {
                rmax.push(j);
            }
            for &x in &lmax {
                for &y in &rmax {
                    ans = min(ans, x.0+a[i]+y.0);
                }
            }

            let mut lmax2 = vec![];
            let mut rmax2 = vec![];
            for j in left.iter().take(3) {
                lmax2.push(j);
            }
            for j in right.iter().take(3) {
                rmax2.push(j);
            }
            for &x in &lmax2 {
                for &y in &rmax2 {
                    if x.0 < a[i] && y.0 < a[i] {
                        ans = min(ans, x.0+a[i]+y.0);
                    }
                }
            }
        }
        left.insert((a[i],i));
    }
    println!("{}",if ans==INF {-1} else {ans});
}

fn run() {
    solve();
}