結果
問題 | No.2364 Knapsack Problem |
ユーザー | naut3 |
提出日時 | 2023-07-01 03:28:01 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,937 bytes |
コンパイル時間 | 12,484 ms |
コンパイル使用メモリ | 385,208 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-07 14:36:27 |
合計ジャッジ時間 | 13,675 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,812 KB |
testcase_02 | AC | 0 ms
6,940 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
コンパイルメッセージ
warning: unused `Result` that must be used --> src/main.rs:80:5 | 80 | writeln!(out, "{}", ans); | ^^^^^^^^^^^^^^^^^^^^^^^^ | = note: this `Result` may be an `Err` variant, which should be handled = note: `#[warn(unused_must_use)]` on by default = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#![allow(non_snake_case, unused_imports)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; } let N = input!(usize); let M = input!(usize); let W = input!(isize); let A = (0..N).map(|_| input!(isize)).collect::<Vec<_>>(); let B = (0..N).map(|_| input!(isize)).collect::<Vec<_>>(); let C = (0..M).map(|_| input!(isize)).collect::<Vec<_>>(); let D = (0..M).map(|_| input!(isize)).collect::<Vec<_>>(); let mut dp = vec![false; 1 << (N + M)]; dp[0] = true; for s in 0..(1 << (N + M)) { for i in 0..N + M { if (s >> i) & 1 == 1 { let mut w = 0; for j in 0..N + M { if i == j { continue; } if (s >> j) & 1 == 1 { if j < N { w += A[j]; } else { w -= C[j - N]; } } if i < N { if 0 <= w + A[i] && w + A[i] <= W { dp[s] = true; } } else { if 0 <= w - C[i - N] && w - C[i - N] <= W { dp[s] = true; } } } } } } let mut ans = 0; for s in 0..(1 << (N + M)) { if dp[s] { let mut v = 0; for i in 0..N + M { if (s >> i) & 1 == 1 { if i < N { v += B[i]; } else { v -= D[i - N]; } } } ans = std::cmp::max(ans, v); } } writeln!(out, "{}", ans); } struct Scanner<R> { reader: R, buf_str: Vec<u8>, buf_iter: str::SplitWhitespace<'static>, } impl<R: BufRead> Scanner<R> { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token<T: str::FromStr>(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }