結果

問題 No.1163 I want to be a high achiever
ユーザー koba-e964
提出日時 2020-08-15 18:05:18
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 3,327 bytes
コンパイル時間 12,885 ms
コンパイル使用メモリ 402,316 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-10 18:20:02
合計ジャッジ時間 14,378 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, x: usize,
        a: [usize; n],
        b: [i64; n],
    }
    let mut excess = 0;
    let mut short = 0;
    let mut bag = vec![];
    for i in 0..n {
        if a[i] >= x {
            excess += a[i] - x;
        } else {
            short += x - a[i];
            bag.push((x - a[i], b[i]));
        }
    }
    if excess >= short {
        puts!("0\n");
        return;
    }
    const INF: i64 = 1 << 50;
    let goal = short - excess;
    eprintln!("goal = {}, bag = {:?}", goal, bag);
    let m = bag.len();
    let mut dp = vec![INF; goal + 1];
    dp[0] = 0;
    for i in 0..m {
        let (v, c) = bag[i];
        for j in (0..goal + 1).rev() {
            let to = min(goal, j + v);
            dp[to] = min(dp[to], dp[j] + c);
        }
    }
    let ans = dp[goal];
    let mut tot = 0;
    for i in 0..n {
        tot += b[i];
    }
    puts!("{}\n", if ans >= tot { -1 } else { ans });
}

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