結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | koba-e964 |
提出日時 | 2020-01-01 18:49:25 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 441 ms / 2,000 ms |
コード長 | 2,946 bytes |
コンパイル時間 | 2,957 ms |
コンパイル使用メモリ | 161,368 KB |
実行使用メモリ | 392,072 KB |
最終ジャッジ日時 | 2023-08-14 16:13:46 |
合計ジャッジ時間 | 17,195 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,384 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 11 ms
9,760 KB |
testcase_10 | AC | 7 ms
5,780 KB |
testcase_11 | AC | 7 ms
6,108 KB |
testcase_12 | AC | 88 ms
77,912 KB |
testcase_13 | AC | 320 ms
273,744 KB |
testcase_14 | AC | 52 ms
45,164 KB |
testcase_15 | AC | 54 ms
48,548 KB |
testcase_16 | AC | 81 ms
72,328 KB |
testcase_17 | AC | 101 ms
89,268 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 7 ms
5,804 KB |
testcase_22 | AC | 4 ms
4,380 KB |
testcase_23 | AC | 5 ms
4,380 KB |
testcase_24 | AC | 441 ms
392,032 KB |
testcase_25 | AC | 438 ms
392,072 KB |
testcase_26 | AC | 435 ms
392,008 KB |
testcase_27 | AC | 434 ms
392,072 KB |
testcase_28 | AC | 414 ms
392,036 KB |
testcase_29 | AC | 420 ms
392,008 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 1 ms
4,376 KB |
testcase_32 | AC | 4 ms
4,376 KB |
testcase_33 | AC | 6 ms
4,524 KB |
testcase_34 | AC | 10 ms
8,420 KB |
testcase_35 | AC | 437 ms
392,072 KB |
testcase_36 | AC | 435 ms
392,008 KB |
testcase_37 | AC | 437 ms
392,012 KB |
testcase_38 | AC | 437 ms
392,028 KB |
testcase_39 | AC | 436 ms
392,012 KB |
testcase_40 | AC | 431 ms
392,064 KB |
testcase_41 | AC | 434 ms
392,060 KB |
testcase_42 | AC | 432 ms
392,036 KB |
testcase_43 | AC | 432 ms
391,976 KB |
testcase_44 | AC | 431 ms
392,072 KB |
testcase_45 | AC | 433 ms
392,012 KB |
testcase_46 | AC | 416 ms
392,016 KB |
testcase_47 | AC | 414 ms
392,012 KB |
testcase_48 | AC | 416 ms
392,064 KB |
testcase_49 | AC | 414 ms
392,012 KB |
testcase_50 | AC | 419 ms
392,028 KB |
testcase_51 | AC | 416 ms
392,008 KB |
testcase_52 | AC | 352 ms
315,452 KB |
testcase_53 | AC | 435 ms
392,008 KB |
testcase_54 | AC | 395 ms
392,032 KB |
ソースコード
#[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); (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }}; ($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)*) => (write!(out,$($format)*).unwrap()); } input! { n: usize, k: usize, pd: [(usize, i64); n], } let mut pd = pd; pd.sort(); const INF: i64 = 1 << 50; let mut dp = vec![vec![[-INF; 2]; k + 1]; n + 1]; dp[0][0] = [0, 0]; for i in 0..n { let (p, d) = pd[i]; for j in 0..k + 1 { for l in 0..2 { dp[i + 1][j][l] = dp[i][j][l]; } } for j in 0..k + 1 { dp[i + 1][j][1] = max(dp[i + 1][j][1], dp[i][j][0] + d); } for j in 0..k - p + 1 { dp[i + 1][j + p][0] = max(dp[i + 1][j + p][0], dp[i][j][1] + d); } } let mut ma = 0; for i in 0..k + 1 { ma = max(ma, dp[n][i][0]); } puts!("{}\n", ma); } 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(); }