結果
問題 | No.771 しおり |
ユーザー | cotton_fn_ |
提出日時 | 2020-04-06 22:17:47 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 189 ms / 2,000 ms |
コード長 | 4,762 bytes |
コンパイル時間 | 12,653 ms |
コンパイル使用メモリ | 403,732 KB |
実行使用メモリ | 20,464 KB |
最終ジャッジ日時 | 2024-07-22 07:22:29 |
合計ジャッジ時間 | 16,336 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 189 ms
20,424 KB |
testcase_01 | AC | 21 ms
6,812 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,944 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 1 ms
6,944 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,940 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 89 ms
11,192 KB |
testcase_26 | AC | 3 ms
6,944 KB |
testcase_27 | AC | 20 ms
6,940 KB |
testcase_28 | AC | 42 ms
6,940 KB |
testcase_29 | AC | 20 ms
6,940 KB |
testcase_30 | AC | 184 ms
20,372 KB |
testcase_31 | AC | 186 ms
20,412 KB |
testcase_32 | AC | 5 ms
6,944 KB |
testcase_33 | AC | 185 ms
20,312 KB |
testcase_34 | AC | 188 ms
20,464 KB |
testcase_35 | AC | 5 ms
6,944 KB |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 2 ms
6,944 KB |
testcase_38 | AC | 5 ms
6,940 KB |
testcase_39 | AC | 1 ms
6,944 KB |
testcase_40 | AC | 86 ms
11,112 KB |
testcase_41 | AC | 183 ms
20,376 KB |
testcase_42 | AC | 184 ms
20,300 KB |
testcase_43 | AC | 19 ms
6,944 KB |
testcase_44 | AC | 184 ms
20,368 KB |
testcase_45 | AC | 184 ms
20,320 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(10 * 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),+) }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!(); }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } } } let n: usize = kin.input(); let mut a = Vec::new(); let mut b = Vec::new(); kin.iter().take(n).for_each(|(x, y): (u32, u32)| { a.push(x); b.push(y); }); let mut dp = vec![[1 << 30; 18]; 1 << n]; for i in 0..n { dp[1 << i][i] = 0; } for s in 1..1 << n { for i in (0..n).filter(|&i| s >> i & 1 == 0) { let t = s | 1 << i; for j in (0..n).filter(|&j| s >> j & 1 == 1) { dp[t][i] = dp[t][i].min(dp[s][j].max(b[i] - a[i] + a[j])); } } } outputln!("{}", dp[(1 << n) - 1][..n].iter().min().unwrap()); } // ----------------------------------------------------------------------------- pub mod kyoproio { #![warn(unused)] use std::io::prelude::*; pub trait Input: Sized { fn str(&mut self) -> &str; fn bytes(&mut self) -> &[u8] { self.str().as_ref() } fn input<T: InputParse>(&mut self) -> T { self.input_fallible().expect("input error") } fn input_fallible<T: InputParse>(&mut self) -> Result<T, T::Err> { T::input(self) } fn iter<T: InputParse>(&mut self) -> Iter<T, Self> { Iter { input: self, _t: 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> { input: &'a mut I, _t: std::marker::PhantomData<*const T>, } impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option<Self::Item> { Some(self.input.input()) } } pub trait InputParse: Sized { type Err: std::fmt::Debug; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err>; } macro_rules! from_str_impls { { $($T:ty)* } => { $(impl InputParse for $T { type Err = <$T as std::str::FromStr>::Err; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { input.str().parse::<$T>() } })* }; } from_str_impls! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impls { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { type Err = (); fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { // ? Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*)) } } tuple_impls!($($T)*); }; () => {}; } tuple_impls!(A B C D E F G); }