結果
問題 | No.506 限られたジャパリまん |
ユーザー | hatoo |
提出日時 | 2017-10-14 20:46:12 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,253 bytes |
コンパイル時間 | 12,356 ms |
コンパイル使用メモリ | 405,908 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-28 04:21:03 |
合計ジャッジ時間 | 13,530 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 21 ms
5,376 KB |
testcase_12 | WA | - |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | WA | - |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | AC | 6 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 7 ms
5,376 KB |
testcase_23 | AC | 5 ms
5,376 KB |
testcase_24 | WA | - |
ソースコード
#[allow(unused_imports)] use std::cmp::{max, min}; #[allow(unused_imports)] use std::collections::{HashMap, HashSet}; mod util { use std::io::stdin; use std::str::FromStr; use std::fmt::Debug; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn get<T: FromStr>() -> T where <T as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().parse().unwrap() } #[allow(dead_code)] pub fn gets<T: FromStr>() -> Vec<T> where <T as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn get2<T: FromStr, U: FromStr>() -> (T, U) where <T as FromStr>::Err: Debug, <U as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } #[allow(dead_code)] pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U) where <S as FromStr>::Err: Debug, <T as FromStr>::Err: Debug, <U as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } } #[allow(unused_macros)] macro_rules! debug { ($x: expr) => { println!("{}: {:?}", stringify!($x), $x) } } const M: u64 = 1000000007; fn routes(x: usize, y: usize, cache: &mut Vec<Vec<Option<u64>>>) -> u64 { if let Some(res) = cache[x][y] { return res; } if x == 0 || y == 0 { return 1; } let left = if x == 0 { 1 } else { routes(x - 1, y, cache) }; let down = if y == 0 { 1 } else { routes(x, y - 1, cache) }; let res = left + down; cache[x][y] = Some(res); res } fn main() { let hwkp: Vec<usize> = util::gets(); let h = hwkp[0]; let w = hwkp[1]; let k = hwkp[2]; let p = hwkp[3]; let xyn: Vec<(usize, usize, String)> = (0..k).map(|_| util::get3()).collect(); let (a, friends) = (0u64..1 << k) .filter(|b| b.count_ones() == p as u32) .map(|b| { let mut cache = vec![vec![None; w + 1]; h + 1]; cache[0][0] = Some(0); for i in 0..k { if b >> i & 1 != 1 { cache[xyn[i].0][xyn[i].1] = Some(0); } } (routes(h, w, &mut cache), b) }) .max() .unwrap(); println!("{}", a % M); for i in (0..k).filter(|&i| friends >> i & 1 == 1) { println!("{}", xyn[i].2); } }