fn main() { input! { h: usize, w: usize, s: [chars; h], } let mut can = vec![vec![false; w]; h]; for i in 0..h { for j in 0..w { if s[i][j] == '#' { continue; } let mut cnt = 0; for x in [!0, 0, 1].iter() { for y in [!0, 0, 1].iter() { let i = i + *x; let j = j + *y; if i < h && j < w && s[i][j] == '#' { cnt += 1; } } } can[i][j] = cnt >= 2; } } let len = 4usize.pow(w as u32 + 1); let decode = |mut b: usize| -> [usize; 11] { let mut res = [0; 11]; for r in res.iter_mut() { *r = b % 4; b /= 4; } res }; let encode = |s: [usize; 11]| -> usize { s.iter().rfold(0, |s, a| s * 4 + *a) }; let inf = 1000i32; let mut dp = vec![-inf; len]; dp[0] = 0; for i in 0..h { for j in 0..w { let neighbor = |x: usize| -> bool { assert!(x < w + 1); if x == 0 { return j > 0; } if x == w { return j > 0; } if x == w - 2 { return j + 1 < w; } x == w - 1 }; let mut ndp = vec![-inf; len]; for (b, dp) in dp.iter().enumerate().filter(|p| *p.1 >= 0) { if s[i][j] == '#' { let mut s = decode(b); if s[w] == 0 || s[w] == 3 { s[w] = 0; s.rotate_right(1); s[0] = 0; ndp[encode(s)].chmax(*dp); } continue; } // 植物 let mut s = decode(b); for i in 0..w + 1 { if neighbor(i) && s[i] < 3 { s[i] = s[i].saturating_sub(1); } } if s[w] == 0 || s[w] == 3 { s[w] = 0; s.rotate_right(1); s[0] = 3; ndp[encode(s)].chmax(*dp); } if can[i][j] { let mut s = decode(b); let mut v = 2usize; for i in 0..w + 1 { if neighbor(i) && s[i] == 3 { v = v.saturating_sub(1); } } if s[w] == 0 || s[w] == 3 { s[w] = 0; s.rotate_right(1); s[0] = v; ndp[encode(s)].chmax(*dp + 1); } } } dp = ndp; } } let mut ans = 0; for (i, dp) in dp.into_iter().enumerate() { let s = decode(i); if s.iter().all(|s| *s == 0 || *s == 3) { ans = ans.max(dp); } } println!("{}", ans); } /* 寄与しない空きますは植物植える 植物/空,後何個いる 4^11? */ // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] 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_export] 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_export] 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::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ----------