結果
問題 | No.288 貯金箱の仕事 |
ユーザー | koba-e964 |
提出日時 | 2017-01-10 23:11:40 |
言語 | Rust (1.77.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,201 bytes |
コンパイル時間 | 2,483 ms |
コンパイル使用メモリ | 141,080 KB |
実行使用メモリ | 492,976 KB |
最終ジャッジ日時 | 2023-08-22 22:25:03 |
合計ジャッジ時間 | 13,614 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
8,792 KB |
testcase_01 | AC | 4 ms
4,792 KB |
testcase_02 | AC | 6 ms
5,888 KB |
testcase_03 | AC | 3 ms
4,376 KB |
testcase_04 | AC | 6 ms
5,812 KB |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | AC | 66 ms
51,764 KB |
testcase_08 | AC | 21 ms
17,464 KB |
testcase_09 | AC | 51 ms
41,012 KB |
testcase_10 | AC | 56 ms
44,972 KB |
testcase_11 | AC | 25 ms
20,408 KB |
testcase_12 | AC | 49 ms
40,168 KB |
testcase_13 | AC | 41 ms
33,308 KB |
testcase_14 | AC | 48 ms
39,096 KB |
testcase_15 | AC | 59 ms
47,832 KB |
testcase_16 | AC | 52 ms
42,000 KB |
testcase_17 | AC | 38 ms
31,236 KB |
testcase_18 | AC | 27 ms
22,464 KB |
testcase_19 | AC | 35 ms
28,348 KB |
testcase_20 | AC | 22 ms
18,560 KB |
testcase_21 | AC | 24 ms
20,376 KB |
testcase_22 | AC | 50 ms
40,224 KB |
testcase_23 | AC | 637 ms
492,932 KB |
testcase_24 | AC | 313 ms
247,944 KB |
testcase_25 | AC | 4 ms
4,756 KB |
testcase_26 | AC | 5 ms
4,840 KB |
testcase_27 | AC | 5 ms
4,852 KB |
testcase_28 | AC | 5 ms
4,848 KB |
testcase_29 | AC | 4 ms
4,844 KB |
testcase_30 | AC | 157 ms
127,272 KB |
testcase_31 | AC | 161 ms
127,340 KB |
testcase_32 | AC | 318 ms
249,836 KB |
testcase_33 | AC | 319 ms
249,832 KB |
testcase_34 | AC | 471 ms
372,328 KB |
testcase_35 | AC | 475 ms
372,340 KB |
testcase_36 | AC | 621 ms
492,976 KB |
testcase_37 | AC | 176 ms
141,020 KB |
testcase_38 | AC | 431 ms
340,904 KB |
testcase_39 | AC | 208 ms
164,552 KB |
testcase_40 | AC | 222 ms
169,588 KB |
testcase_41 | AC | 594 ms
471,340 KB |
testcase_42 | AC | 519 ms
409,548 KB |
testcase_43 | AC | 368 ms
288,044 KB |
testcase_44 | AC | 258 ms
201,792 KB |
testcase_45 | AC | 476 ms
378,144 KB |
testcase_46 | AC | 523 ms
414,532 KB |
testcase_47 | AC | 349 ms
274,372 KB |
testcase_48 | AC | 381 ms
299,728 KB |
testcase_49 | AC | 229 ms
181,196 KB |
testcase_50 | AC | 304 ms
237,168 KB |
testcase_51 | AC | 221 ms
171,428 KB |
testcase_52 | AC | 313 ms
242,980 KB |
testcase_53 | AC | 404 ms
316,364 KB |
testcase_54 | AC | 282 ms
219,476 KB |
testcase_55 | AC | 5 ms
5,900 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::*; #[allow(dead_code)] fn getline() -> String { let mut ret = String::new(); std::io::stdin().read_line(&mut ret).ok(); return ret; } fn get_word() -> String { let mut stdin = std::io::stdin(); let mut u8b: [u8; 1] = [0]; loop { let mut buf: Vec<u8> = Vec::with_capacity(16); loop { let res = stdin.read(&mut u8b); if res.is_err() || res.ok().unwrap() == 0 || u8b[0] <= ' ' as u8 { break; } else { buf.push(u8b[0]); } } if buf.len() >= 1 { let ret = std::string::String::from_utf8(buf).unwrap(); return ret; } } } fn parse<T: std::str::FromStr>(s: &str) -> T { s.parse::<T>().ok().unwrap() } #[allow(dead_code)] fn get<T: std::str::FromStr>() -> T { parse(&get_word()) } fn solve(a: &[i64], v: i64) -> Option<i64> { let n = a.len(); const W: usize = 250000; const INF: i32 = 0x3fff_ffff; let mut dp: Vec<Vec<i32>> = vec![vec![INF; W]; n + 1]; dp[0][0] = 0; for i in 0 .. n { let cur = a[i] as usize; for j in 0 .. W { let mut mi = dp[i][j]; if j >= cur { mi = min(mi, dp[i + 1][j - cur] + 1); } dp[i + 1][j] = mi; } } if v < W as i64 { let tmp = dp[n][v as usize]; if tmp >= INF { return None; } return Some(tmp as i64); } let biggest = a[n - 1] as i64; let diff = (v + 1 - W as i64 + biggest - 1) / biggest * biggest; assert!(v - diff < W as i64); let tmp = dp[n][(v - diff) as usize]; if tmp >= INF { return None; } return Some(tmp as i64 + diff / biggest); } fn main() { let n: usize = get(); let m: i64 = get(); let a: Vec<i64> = (0 .. n).map(|_| get()).collect(); let k: Vec<i64> = (0 .. n).map(|_| get()).collect(); let mut diff: i64 = 0; for i in 0 .. n { diff += a[i] * k[i]; } diff -= m; let result = solve(&a, diff); println!("{}", result.unwrap_or(-1)); }