#490533 (Rust) No.324 落ちてた閉路グラフ

• 問題: No.324 落ちてた閉路グラフ
• ユーザー: cotton_fn_
• 提出日時: 2020-06-02 00:35:25
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 90 ms / 5,000 ms
• コード長: 4,937 bytes
• コンパイル時間: 13,470 ms
• コンパイル使用メモリ: 400,740 KB
• 実行使用メモリ: 142,872 KB
• 最終ジャッジ日時: 2024-12-14 13:16:33
• 合計ジャッジ時間: 15,917 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,820 KB
testcase_02	AC	1 ms; 6,816 KB
testcase_03	AC	1 ms; 6,816 KB
testcase_04	AC	59 ms; 142,856 KB
testcase_05	AC	90 ms; 142,868 KB
testcase_06	AC	55 ms; 142,740 KB
testcase_07	AC	84 ms; 142,736 KB
testcase_08	AC	54 ms; 142,740 KB
testcase_09	AC	46 ms; 142,740 KB
testcase_10	AC	56 ms; 142,864 KB
testcase_11	AC	45 ms; 142,872 KB
testcase_12	AC	36 ms; 132,888 KB
testcase_13	AC	22 ms; 81,248 KB
testcase_14	AC	16 ms; 40,308 KB
testcase_15	AC	24 ms; 55,036 KB
testcase_16	AC	1 ms; 6,816 KB
testcase_17	AC	1 ms; 6,816 KB
testcase_18	AC	1 ms; 6,816 KB
testcase_19	AC	1 ms; 6,816 KB
testcase_20	AC	1 ms; 6,820 KB
testcase_21	AC	1 ms; 6,816 KB
testcase_22	AC	2 ms; 6,816 KB
testcase_23	AC	1 ms; 6,816 KB
testcase_24	AC	1 ms; 6,816 KB
testcase_25	AC	1 ms; 6,820 KB
testcase_26	AC	1 ms; 6,816 KB
testcase_27	AC	1 ms; 6,816 KB
testcase_28	AC	2 ms; 6,816 KB
testcase_29	AC	1 ms; 6,816 KB
testcase_30	AC	1 ms; 6,820 KB
testcase_31	AC	1 ms; 6,816 KB
testcase_32	AC	87 ms; 142,740 KB
testcase_33	AC	79 ms; 142,740 KB
testcase_34	AC	49 ms; 117,736 KB
testcase_35	AC	4 ms; 9,380 KB
testcase_36	AC	30 ms; 97,184 KB
testcase_37	AC	4 ms; 6,880 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    let (n, m): (usize, usize) = kin.input();
    let w: Vec<i32> = kin.seq(n);
    let mut dp = vec![[[[-INF; 2]; 2]; 3001]; n + 1];
    const INF: i32 = 1 << 25;
    dp[0][0][0][0] = 0;
    dp[0][1][1][1] = 0;
    for i in 1..n {
        for j in 0..=m {
            for f in 0..2 {
                dp[i][j][f][0] = dp[i - 1][j][f][0].max(dp[i - 1][j][f][1]);
                if j > 0 {
                    dp[i][j][f][1] = dp[i - 1][j - 1][f][0].max(dp[i - 1][j - 1][f][1] + w[i - 1]);
                }
            }
        }
    }
    dp[n - 1][m][1][1] += w[n - 1];
    let mut ans = -INF;
    for f in 0..2 {
        for l in 0..2 {
            ans.chmax(dp[n - 1][m][f][l]);
        }
    }
    outputln!("{}", ans);
}

trait OrdExt: Ord + Sized {
    fn chmax(&mut self, x: Self) -> bool {
        let c = x > *self;
        if c {
            *self = x;
        }
        c
    }
}
impl<T: Ord> OrdExt for T {}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn src(&mut self) -> &mut R {
            &mut self.src
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}