結果

問題 No.2686 商品券の使い道
コンテスト
ユーザー koba-e964
提出日時 2024-04-15 03:38:53
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 298 ms / 3,000 ms
コード長 3,272 bytes
コンパイル時間 14,805 ms
コンパイル使用メモリ 401,580 KB
実行使用メモリ 34,716 KB
最終ジャッジ日時 2024-10-04 13:54:13
合計ジャッジ時間 25,131 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 48
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `puts`
  --> src/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`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `out`
  --> src/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
  --> src/main.rs:61:9
   |
61 |     let mut out = BufWriter::new(out.lock());
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

ソースコード

diff # 

#[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);
}
0