結果

問題 No.2364 Knapsack Problem
ユーザー haihamabossu
提出日時 2023-06-30 22:29:24
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 2 ms / 3,000 ms
コード長 2,571 bytes
コンパイル時間 12,311 ms
コンパイル使用メモリ 391,196 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-07 10:20:25
合計ジャッジ時間 13,235 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

pub mod scanner {
    pub struct Scanner {
        buf: Vec<String>,
    }
    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }
        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }
        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }
        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}
use crate::scanner::Scanner;
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = 1;
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let n: usize = scanner.next();
    let m: usize = scanner.next();
    let w: isize = scanner.next();
    let a = (0..n).map(|_| scanner.next::<isize>()).collect::<Vec<_>>();
    let b = (0..n).map(|_| scanner.next::<isize>()).collect::<Vec<_>>();
    let c = (0..m).map(|_| scanner.next::<isize>()).collect::<Vec<_>>();
    let d = (0..m).map(|_| scanner.next::<isize>()).collect::<Vec<_>>();
    let s = 1 << (n + m);
    let mut dp: Vec<Option<(isize, isize)>> = vec![None; s];
    dp[0] = Some((0, 0));
    let mut ans = 0;
    for bits in 0..s {
        if let Some((cw, cv)) = dp[bits] {
            for i in 0..n + m {
                if ((bits >> i) & 1) == 1 {
                    continue;
                }
                let mut nw = cw;
                let mut nv = cv;
                if i < n {
                    nw += a[i];
                    nv += b[i];
                } else {
                    nw -= c[i - n];
                    nv -= d[i - n];
                }
                if 0 <= nw && nw <= w {
                    let next = bits | (1 << i);
                    dp[next] = Some((nw, nv));
                    ans = ans.max(nv);
                }
            }
        }
    }
    writeln!(out, "{}", ans).unwrap();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0