結果
問題 | No.1861 Required Number |
ユーザー | akakimidori |
提出日時 | 2022-03-04 21:31:23 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 121 ms / 2,500 ms |
コード長 | 2,936 bytes |
コンパイル時間 | 1,334 ms |
コンパイル使用メモリ | 153,312 KB |
実行使用メモリ | 8,760 KB |
最終ジャッジ日時 | 2023-09-26 03:12:20 |
合計ジャッジ時間 | 18,123 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
8,388 KB |
testcase_01 | AC | 1 ms
8,428 KB |
testcase_02 | AC | 1 ms
8,752 KB |
testcase_03 | AC | 121 ms
8,416 KB |
testcase_04 | AC | 121 ms
8,460 KB |
testcase_05 | AC | 1 ms
8,760 KB |
testcase_06 | AC | 1 ms
8,760 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 1 ms
4,376 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 20 ms
4,376 KB |
testcase_25 | AC | 54 ms
4,376 KB |
testcase_26 | AC | 10 ms
4,376 KB |
testcase_27 | AC | 21 ms
4,376 KB |
testcase_28 | AC | 23 ms
4,380 KB |
testcase_29 | AC | 14 ms
4,376 KB |
testcase_30 | AC | 5 ms
4,380 KB |
testcase_31 | AC | 54 ms
4,380 KB |
testcase_32 | AC | 7 ms
4,380 KB |
testcase_33 | AC | 37 ms
4,380 KB |
testcase_34 | AC | 44 ms
4,380 KB |
testcase_35 | AC | 46 ms
4,380 KB |
testcase_36 | AC | 15 ms
4,380 KB |
testcase_37 | AC | 24 ms
4,376 KB |
testcase_38 | AC | 46 ms
4,376 KB |
testcase_39 | AC | 26 ms
4,380 KB |
testcase_40 | AC | 56 ms
4,376 KB |
testcase_41 | AC | 51 ms
4,380 KB |
testcase_42 | AC | 43 ms
4,380 KB |
testcase_43 | AC | 24 ms
4,384 KB |
testcase_44 | AC | 1 ms
4,376 KB |
04_evil_1.txt | TLE | - |
04_evil_2.txt | TLE | - |
04_evil_3.txt | TLE | - |
04_evil_4.txt | TLE | - |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> Main.rs:67:5 | 67 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: function `rand_memory` is never used --> Main.rs:1:4 | 1 | fn rand_memory() -> usize { | ^^^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: function `rand` is never used --> Main.rs:5:4 | 5 | fn rand() -> usize { | ^^^^ warning: type alias `Map` is never used --> Main.rs:70:6 | 70 | type Map<K, V> = BTreeMap<K, V>; | ^^^ warning: type alias `Set` is never used --> Main.rs:71:6 | 71 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> Main.rs:72:6 | 72 | type Deque<T> = VecDeque<T>; | ^^^^^ warning: 6 warnings emitted
ソースコード
fn rand_memory() -> usize { Box::into_raw(Box::new("I hope this is a random number")) as usize } fn rand() -> usize { static mut X: usize = 0; unsafe { if X == 0 { X = rand_memory(); } X ^= X << 13; X ^= X >> 17; X ^= X << 5; X } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { n: usize, k: usize, a: [usize; n], } let mut dp = vec![false; k + 1]; dp[0] = true; let calc = |a: usize, dp: &mut [bool]| { for i in (a..dp.len()).rev() { dp[i] |= dp[i - a]; } }; let mut elem = false; let mut ans = 0; let mut dfs = vec![(a.as_slice(), dp)]; while let Some((a, mut dp)) = dfs.pop() { if a.len() == 1 { let a = a[0]; if a > 0 && !dp[k] && dp[k - a] { ans += 1; } if dp[k] { elem = true; } continue; } let m = a.len() / 2; let (l, r) = a.split_at(m); let save = dp.clone(); for l in l.iter() { calc(*l, &mut dp); } dfs.push((r, dp)); let mut dp = save; for l in r.iter() { calc(*l, &mut dp); } dfs.push((l, dp)); } if ans == 0 && !elem { ans = -1; } println!("{}", ans); } fn main() { run(); }