結果
問題 | No.2686 商品券の使い道 |
ユーザー | koba-e964 |
提出日時 | 2024-04-15 03:38:53 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 303 ms / 3,000 ms |
コード長 | 3,272 bytes |
コンパイル時間 | 1,791 ms |
コンパイル使用メモリ | 185,536 KB |
実行使用メモリ | 34,836 KB |
最終ジャッジ日時 | 2024-04-15 03:39:10 |
合計ジャッジ時間 | 10,757 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 71 ms
10,076 KB |
testcase_03 | AC | 69 ms
10,176 KB |
testcase_04 | AC | 70 ms
10,096 KB |
testcase_05 | AC | 69 ms
10,016 KB |
testcase_06 | AC | 70 ms
10,088 KB |
testcase_07 | AC | 70 ms
10,084 KB |
testcase_08 | AC | 69 ms
10,172 KB |
testcase_09 | AC | 69 ms
10,028 KB |
testcase_10 | AC | 70 ms
10,020 KB |
testcase_11 | AC | 67 ms
10,036 KB |
testcase_12 | AC | 68 ms
10,052 KB |
testcase_13 | AC | 69 ms
10,020 KB |
testcase_14 | AC | 67 ms
10,020 KB |
testcase_15 | AC | 66 ms
10,012 KB |
testcase_16 | AC | 67 ms
10,052 KB |
testcase_17 | AC | 68 ms
10,028 KB |
testcase_18 | AC | 66 ms
10,048 KB |
testcase_19 | AC | 69 ms
10,056 KB |
testcase_20 | AC | 69 ms
10,076 KB |
testcase_21 | AC | 69 ms
10,060 KB |
testcase_22 | AC | 73 ms
10,096 KB |
testcase_23 | AC | 69 ms
10,040 KB |
testcase_24 | AC | 69 ms
10,088 KB |
testcase_25 | AC | 69 ms
10,012 KB |
testcase_26 | AC | 69 ms
10,076 KB |
testcase_27 | AC | 73 ms
10,244 KB |
testcase_28 | AC | 75 ms
10,056 KB |
testcase_29 | AC | 283 ms
34,592 KB |
testcase_30 | AC | 276 ms
34,592 KB |
testcase_31 | AC | 275 ms
34,600 KB |
testcase_32 | AC | 275 ms
34,712 KB |
testcase_33 | AC | 275 ms
34,652 KB |
testcase_34 | AC | 280 ms
34,672 KB |
testcase_35 | AC | 280 ms
34,832 KB |
testcase_36 | AC | 303 ms
34,660 KB |
testcase_37 | AC | 275 ms
34,608 KB |
testcase_38 | AC | 275 ms
34,636 KB |
testcase_39 | AC | 272 ms
34,596 KB |
testcase_40 | AC | 273 ms
34,612 KB |
testcase_41 | AC | 297 ms
34,836 KB |
testcase_42 | AC | 273 ms
34,692 KB |
testcase_43 | AC | 276 ms
34,812 KB |
testcase_44 | AC | 294 ms
34,716 KB |
testcase_45 | AC | 277 ms
34,592 KB |
testcase_46 | AC | 279 ms
34,764 KB |
evil_random20_1.txt | AC | 283 ms
34,720 KB |
evil_random20_2.txt | AC | 300 ms
34,588 KB |
evil_random20_3.txt | AC | 284 ms
34,596 KB |
コンパイルメッセージ
warning: unused macro definition: `puts` --> main.rs:62:18 | 62 | macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} | ^^^^ | = note: `#[warn(unused_macros)]` on by default warning: unused import: `Write` --> main.rs:5:15 | 5 | use std::io::{Write, BufWriter}; | ^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: unused variable: `out` --> main.rs:61:13 | 61 | let mut out = BufWriter::new(out.lock()); | ^^^ help: if this is intentional, prefix it with an underscore: `_out` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> main.rs:61:9 | 61 | let mut out = BufWriter::new(out.lock()); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: 4 warnings emitted
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes.by_ref().map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr,) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::<Vec<char>>() }; ($next:expr, usize1) => (read_value!($next, usize) - 1); ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); read_value!($next, [$t; len]) }}; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} #[allow(unused)] macro_rules! putvec { ($v:expr) => { for i in 0..$v.len() { puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "}); } } } input! { n: usize, m: i64, q: i64, ab: [(i64, i64); n], } let mut val = vec![(0, 0); 1 << n]; for bits in 1..1 << n { let mut sum = (0, 0); for i in 0..n { if (bits & 1 << i) == 0 { continue; } sum.0 += ab[i].0; sum.1 += ab[i].1; } val[bits] = sum; } let res = [m, q]; let mut dpmq = vec![[0; 2]; 1 << n]; for bits in 1..1 << n { for b in 0..2 { let mut me = 0; for i in 0..n { if (bits & 1 << i) == 0 { continue; } let sub = dpmq[bits ^ 1 << i][b]; me = max(me, sub); } if val[bits].0 <= res[b] { me = max(me, val[bits].1); } dpmq[bits][b] = me; } } let mut ans = 0; for bits in 0..1 << n { ans = max(ans, dpmq[bits][0] + dpmq[(1 << n) - 1 - bits][1]); } println!("{}", ans); }