結果
問題 | No.1106 🦉 何事もバランスが大事 |
ユーザー | koba-e964 |
提出日時 | 2020-07-12 15:01:16 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,371 bytes |
コンパイル時間 | 13,554 ms |
コンパイル使用メモリ | 378,828 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 03:16:53 |
合計ジャッジ時間 | 15,860 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 1 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 1 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 1 ms
5,248 KB |
testcase_17 | AC | 1 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 1 ms
5,248 KB |
testcase_20 | AC | 1 ms
5,248 KB |
testcase_21 | AC | 1 ms
5,248 KB |
testcase_22 | AC | 1 ms
5,248 KB |
testcase_23 | AC | 1 ms
5,248 KB |
testcase_24 | AC | 1 ms
5,248 KB |
testcase_25 | AC | 1 ms
5,248 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 1 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 1 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
testcase_31 | AC | 1 ms
5,248 KB |
testcase_32 | AC | 1 ms
5,248 KB |
testcase_33 | AC | 1 ms
5,248 KB |
testcase_34 | AC | 1 ms
5,248 KB |
testcase_35 | AC | 1 ms
5,248 KB |
testcase_36 | AC | 1 ms
5,248 KB |
testcase_37 | AC | 1 ms
5,248 KB |
testcase_38 | AC | 1 ms
5,248 KB |
testcase_39 | AC | 1 ms
5,248 KB |
testcase_40 | AC | 1 ms
5,248 KB |
testcase_41 | AC | 1 ms
5,248 KB |
testcase_42 | AC | 1 ms
5,248 KB |
testcase_43 | AC | 1 ms
5,248 KB |
testcase_44 | AC | 1 ms
5,248 KB |
testcase_45 | AC | 1 ms
5,248 KB |
testcase_46 | AC | 1 ms
5,248 KB |
testcase_47 | AC | 1 ms
5,248 KB |
testcase_48 | AC | 1 ms
5,248 KB |
testcase_49 | AC | 1 ms
5,248 KB |
testcase_50 | AC | 1 ms
5,248 KB |
testcase_51 | AC | 1 ms
5,248 KB |
testcase_52 | AC | 1 ms
5,248 KB |
testcase_53 | AC | 1 ms
5,248 KB |
testcase_54 | AC | 1 ms
5,248 KB |
testcase_55 | AC | 1 ms
5,248 KB |
testcase_56 | AC | 1 ms
5,248 KB |
testcase_57 | AC | 1 ms
5,248 KB |
testcase_58 | AC | 1 ms
5,248 KB |
testcase_59 | AC | 1 ms
5,248 KB |
testcase_60 | AC | 1 ms
5,248 KB |
testcase_61 | AC | 1 ms
5,248 KB |
testcase_62 | AC | 1 ms
5,248 KB |
testcase_63 | AC | 1 ms
5,248 KB |
testcase_64 | AC | 1 ms
5,248 KB |
testcase_65 | AC | 1 ms
5,248 KB |
testcase_66 | AC | 1 ms
5,248 KB |
testcase_67 | AC | 1 ms
5,248 KB |
testcase_68 | AC | 1 ms
5,248 KB |
testcase_69 | AC | 1 ms
5,248 KB |
testcase_70 | AC | 1 ms
5,248 KB |
testcase_71 | AC | 1 ms
5,248 KB |
testcase_72 | AC | 1 ms
5,248 KB |
testcase_73 | AC | 1 ms
5,248 KB |
testcase_74 | AC | 1 ms
5,248 KB |
testcase_75 | AC | 1 ms
5,248 KB |
testcase_76 | AC | 1 ms
5,248 KB |
testcase_77 | AC | 1 ms
5,248 KB |
testcase_78 | AC | 1 ms
5,248 KB |
testcase_79 | AC | 1 ms
5,248 KB |
testcase_80 | AC | 2 ms
5,248 KB |
testcase_81 | AC | 1 ms
5,248 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; // 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")); } // ref: https://kuretchi.github.io/blog/entries/automaton-dp/ /// An (almost) DFA. trans is allowed to return None. /// S: alphabet (the set consisting of letters) trait DFA<S> { fn size(&self) -> usize; fn trans(&self, state: usize, char: S) -> Option<usize>; fn init(&self) -> Vec<usize>; fn is_final_state(&self, state: usize) -> bool; } trait ActionMonoid<S> { type T; fn add(&self, x: Self::T, y: Self::T) -> Self::T; fn act(&self, x: Self::T, letter: S) -> Self::T; } struct Add; impl ActionMonoid<i32> for Add { type T = i64; fn add(&self, x: i64, y: i64) -> i64 { x + y } fn act(&self, x: i64, _y: i32) -> i64 { x } } const N: usize = 30; struct GtZero; impl DFA<i32> for GtZero { fn size(&self) -> usize { 8 * N } fn trans(&self, st: usize, c: i32) -> Option<usize> { let (delta, zero) = ((st / 2) as i32, st % 2); if zero == 1 && c < 0 { return None; } if delta + c < 0 || delta + c >= 4 * N as i32 { return None; } Some(2 * (delta + c) as usize + (zero & if c == 0 { 1 } else { 0 })) } fn init(&self) -> Vec<usize> { vec![4 * N + 1] } fn is_final_state(&self, state: usize) -> bool { state == 4 * N } } fn digital_dp<A: DFA<i32>, M: ActionMonoid<i32, T = i64>>( dfa: A, monoid: M, alpha: &[i32], a: &[i32] ) -> [M::T; 2] { let n = dfa.size(); let len = a.len(); let init = dfa.init(); let mut dp = vec![vec![[0; 2]; n]; len + 1]; for &v in &init { dp[0][v][1] = 1; } for i in 0..len { for j in 0..n { for eq in 0..2 { let val = dp[i][j][eq]; for &c in alpha { if eq == 1 && c > a[i] { continue; } if let Some(to) = dfa.trans(j, c) { dp[i + 1][to][eq & if c == a[i] { 1 } else { 0 }] += monoid.act(val, c); } } } } } let mut ans = [0; 2]; for i in 0..n { if dfa.is_final_state(i) { for j in 0..2 { ans[j] += dp[len][i][j]; } } } ans } fn main() { input!(n: i64); const N: usize = 30; let alpha = [-2, -1, 0, 1, 2]; let mut dig = vec![0; N]; let mut v = n; for i in 0..N { let mut r = v % 5; if r >= 3 { r -= 5; } dig[N - 1 - i] = r as i32; v = (v - r) / 5; } let dp = digital_dp(GtZero, Add, &alpha, &dig); println!("{}", dp[0] + dp[1]); }