#475197 (Rust) No.1045 直方体大学

• 問題: No.1045 直方体大学
• ユーザー: cotton_fn_
• 提出日時: 2020-05-02 04:26:40
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 389 ms / 2,000 ms
• コード長: 4,958 bytes
• コンパイル時間: 23,759 ms
• コンパイル使用メモリ: 383,812 KB
• 実行使用メモリ: 26,624 KB
• 最終ジャッジ日時: 2024-06-07 19:28:49
• 合計ジャッジ時間: 17,333 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,812 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	3 ms; 6,940 KB
testcase_06	AC	3 ms; 6,940 KB
testcase_07	AC	3 ms; 6,940 KB
testcase_08	AC	275 ms; 26,496 KB
testcase_09	AC	273 ms; 26,496 KB
testcase_10	AC	266 ms; 26,624 KB
testcase_11	AC	276 ms; 26,624 KB
testcase_12	AC	281 ms; 26,496 KB
testcase_13	AC	281 ms; 26,624 KB
testcase_14	AC	275 ms; 26,496 KB
testcase_15	AC	283 ms; 26,496 KB
testcase_16	AC	283 ms; 26,496 KB
testcase_17	AC	1 ms; 6,940 KB
testcase_18	AC	389 ms; 26,624 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: usize = kin.input();
    let b: Vec<(u64, u64, u64)> = kin.seq(n);
    let f = |i, d| {
        let (a, b, c) = b[i];
        let (mut x, mut y, z) = match d {
            0 => (a, b, c),
            1 => (b, c, a),
            2 => (c, a, b),
            _ => panic!()
        };
        if x < y {
            swap(&mut x, &mut y);
        }
        (x, y, z)
    };
    let mut dp = vec![[[0; 3]; 16]; 1 << n];
    for s in 0..1 << n {
        for i in 0..n {
            if s & 1 << i != 0 {
                continue;
            }
            for j in 0..n {
                for di in 0..3 {
                    for dj in 0..3 {
                        let (xi, yi, zi) = f(i, di);
                        let (xj, yj, _) = f(j, dj);
                        if xi <= xj && yi <= yj {
                            let t = s | 1 << i;
                            dp[t][i][di] = dp[t][i][di].max(dp[s][j][dj] + zi);
                        }
                    }
                }
            }
        }
    }
    let mut ans = 0;
    for i in 0..n {
        for d in 0..3 {
            ans = ans.max(dp[(1 << n) - 1][i][d]);
        }
    }
    outputln!("{}", ans);
}

// -----------------------------------------------------------------------------
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,
            }
        }
    }
    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);
}