#503952 (Rust) No.1095 Smallest Kadomatsu Subsequence

• 問題: No.1095 Smallest Kadomatsu Subsequence
• ユーザー: kaki
• 提出日時: 2020-06-27 09:30:38
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 186 ms / 2,000 ms
• コード長: 3,321 bytes
• コンパイル時間: 13,153 ms
• コンパイル使用メモリ: 386,404 KB
• 実行使用メモリ: 10,664 KB
• 最終ジャッジ日時: 2024-07-05 08:54:24
• 合計ジャッジ時間: 16,693 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 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	1 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	7 ms; 5,376 KB
testcase_14	AC	8 ms; 5,376 KB
testcase_15	AC	8 ms; 5,376 KB
testcase_16	AC	8 ms; 5,376 KB
testcase_17	AC	8 ms; 5,376 KB
testcase_18	AC	7 ms; 5,376 KB
testcase_19	AC	8 ms; 5,376 KB
testcase_20	AC	8 ms; 5,376 KB
testcase_21	AC	7 ms; 5,376 KB
testcase_22	AC	7 ms; 5,376 KB
testcase_23	AC	186 ms; 10,224 KB
testcase_24	AC	184 ms; 10,224 KB
testcase_25	AC	178 ms; 10,228 KB
testcase_26	AC	178 ms; 10,220 KB
testcase_27	AC	177 ms; 10,224 KB
testcase_28	AC	93 ms; 10,660 KB
testcase_29	AC	68 ms; 10,664 KB
testcase_30	AC	133 ms; 10,284 KB
testcase_31	AC	132 ms; 10,152 KB
testcase_32	AC	132 ms; 10,280 KB

ソースコード

#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

const INF: usize = 1 << 60;

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let A: Vec<usize> = sc.vec(N);
    let mut minl = vec![INF; N+1];
    for i in 0..N {
        minl[i+1] = min(minl[i], A[i]);
    }
    let mut minr = vec![INF; N+1];
    for i in (0..N).rev() {
        minr[i] = min(minr[i+1], A[i]);
    }
    let mut ans = INF;
    for i in 1..N-1 {
        if A[i] > minl[i] && A[i] > minr[i+1] {
            ans = min(ans, A[i] + minl[i] + minr[i+1]);
        }
    }
    let mut r: BTreeSet<usize> = A.clone().into_iter().collect();
    let mut l: BTreeSet<usize> = BTreeSet::new();
    l.insert(A[0]);
    r.remove(&A[0]);
    for i in 1..N-1 {
        l.remove(&A[i]);
        r.remove(&A[i]);
        let al = l.range(A[i]+1..).next();
        let ar = r.range(A[i]+1..).next();
        if let (Some(&al), Some(&ar)) = (al, ar) {
            ans = min(ans, A[i] + al + ar);
        }
        l.insert(A[i]);
    }
    if ans != INF {
        println!("{}", ans);
    } else {
        println!("-1");
    }
}