#443876 (Rust) No.951 【本日限定】１枚頼むともう１枚無料！

• 問題: No.951 【本日限定】１枚頼むともう１枚無料！
• ユーザー: cotton_fn_
• 提出日時: 2020-03-14 12:56:49
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 89 ms / 2,000 ms
• コード長: 4,774 bytes
• コンパイル時間: 15,026 ms
• コンパイル使用メモリ: 385,212 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-23 18:42:55
• 合計ジャッジ時間: 16,201 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
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	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	1 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	18 ms; 5,248 KB
testcase_13	AC	58 ms; 5,248 KB
testcase_14	AC	10 ms; 5,248 KB
testcase_15	AC	9 ms; 5,248 KB
testcase_16	AC	14 ms; 5,248 KB
testcase_17	AC	17 ms; 5,248 KB
testcase_18	AC	1 ms; 5,248 KB
testcase_19	AC	1 ms; 5,248 KB
testcase_20	AC	1 ms; 5,248 KB
testcase_21	AC	2 ms; 5,248 KB
testcase_22	AC	1 ms; 5,248 KB
testcase_23	AC	2 ms; 5,248 KB
testcase_24	AC	86 ms; 5,248 KB
testcase_25	AC	88 ms; 5,248 KB
testcase_26	AC	83 ms; 5,248 KB
testcase_27	AC	83 ms; 5,248 KB
testcase_28	AC	66 ms; 5,248 KB
testcase_29	AC	67 ms; 5,248 KB
testcase_30	AC	1 ms; 5,248 KB
testcase_31	AC	1 ms; 5,248 KB
testcase_32	AC	2 ms; 5,248 KB
testcase_33	AC	1 ms; 5,248 KB
testcase_34	AC	3 ms; 5,248 KB
testcase_35	AC	87 ms; 5,248 KB
testcase_36	AC	89 ms; 5,248 KB
testcase_37	AC	89 ms; 5,248 KB
testcase_38	AC	88 ms; 5,248 KB
testcase_39	AC	87 ms; 5,248 KB
testcase_40	AC	83 ms; 5,248 KB
testcase_41	AC	81 ms; 5,248 KB
testcase_42	AC	82 ms; 5,248 KB
testcase_43	AC	82 ms; 5,248 KB
testcase_44	AC	84 ms; 5,248 KB
testcase_45	AC	82 ms; 5,248 KB
testcase_46	AC	67 ms; 5,248 KB
testcase_47	AC	69 ms; 5,248 KB
testcase_48	AC	70 ms; 5,248 KB
testcase_49	AC	66 ms; 5,248 KB
testcase_50	AC	70 ms; 5,248 KB
testcase_51	AC	69 ms; 5,248 KB
testcase_52	AC	70 ms; 5,248 KB
testcase_53	AC	88 ms; 5,248 KB
testcase_54	AC	48 ms; 5,248 KB

ソースコード

#![allow(unused)]

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

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

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

    let (n, k): (usize, usize) = kin.input();
    let mut pd: Vec<(usize, i64)> = kin.iter().take(n).collect();
    pd.sort_by(|(p, _), (q, _)| q.cmp(p));

    let mut dp = vec![[0, -(1 << 30)]; k + 1];
    let mut dp_new = Vec::new();
    for (p, d) in pd {
        dp_new.clear();
        dp_new.extend_from_slice(&dp);
        for i in 0..=k {
            dp_new[i][0] = dp_new[i][0].max(dp[i][1] + d);
        }
        for i in 0..=k - p {
            dp_new[i + p][1] = dp_new[i + p][1].max(dp[i][0] + d);
        }
        swap(&mut dp, &mut dp_new);
    }
    let ans = dp.iter().map(|[x, y]| x.max(y)).max();
    outputln!("{}", ans.unwrap());
}


// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]

    pub use std::io::prelude::*;

    pub struct Input<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> Input<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(256),
                pos: 0,
            }
        }
        pub fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.buf.clear();
                    let len = self.src.read_line(&mut self.buf).expect("io error");
                    self.pos = 0;
                    if len == 0 {
                        return &self.buf;
                    }
                    if self.buf.ends_with('\n') {
                        self.buf.pop();
                    }
                    if self.buf.ends_with('\r') {
                        self.buf.pop();
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(' ')
                        .map(|i| i + self.pos)
                        .unwrap_or(self.buf.len());
                self.pos = range.end + 1;
                if range.end - range.start > 0 {
                    return &self.buf[range];
                }
            }
        }
        pub fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        pub fn input<T: InputParse>(&mut self) -> T {
            self.input_fallible().expect("input error")
        }
        pub fn input_fallible<T: InputParse>(&mut self) -> Result<T> {
            T::input(self)
        }
        pub fn iter<T: InputParse>(&mut self) -> Iter<T, R> {
            Iter {
                input: self,
                _t: std::marker::PhantomData,
            }
        }
    }
    pub struct Iter<'a, T, R> {
        input: &'a mut Input<R>,
        _t: std::marker::PhantomData<T>,
    }
    impl<'a, T: InputParse, R: BufRead> Iterator for Iter<'a, T, R> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.input.input())
        }
    }
    type Result<T> = std::result::Result<T, Box<dyn std::error::Error + 'static>>;
    pub trait InputParse: Sized {
        fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self>;
    }
    macro_rules! input_from_str_impls {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    input.str().parse::<$T>().map_err(|e| e.into())
                }
            })*
        };
    }
    macro_rules! input_tuple_impls {
        { $(($($T:ident),+))* } => {
            $(impl<$($T:InputParse),+> InputParse for ($($T),+) {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    Ok(($($T::input(input)?),+))
                }
            })*
        };
    }
    input_from_str_impls! {
        String char bool f32 f64
        isize i8 i16 i32 i64 i128
        usize u8 u16 u32 u64 u128
    }
    input_tuple_impls! {
        (A, B)
        (A, B, C)
        (A, B, C, D)
        (A, B, C, D, E)
        (A, B, C, D, E, F)
        (A, B, C, D, E, F, G)
    }
}