#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll H,W;cin>>H>>W; if(H==1||W==1){cout<<0<S(H);cin>>S; vvl C(H,vl(W)); rep(i,0,H)rep(j,0,W)if(S[i][j]=='#')rep(x,i-1,i+2)rep(y,j-1,j+2)if(x>=0&&x=0&&y1&&!((s>>W)&1)){ if(j==1)c=(s&1)+((s>>(W-1))&1)+((s>>(2*W-1))&1)+((s>>(2*W))&1); else c=(s&1)+((s>>1)&1)+((s>>(W-1))&1)+((s>>(W+1))&1)+((s>>(2*W-1))&1)+((s>>(2*W))&1)+((s>>(2*W+1))&1); } ll d=0; if(j==W-1&&i&&C[i-1][j]>1&&!((s>>(W-1))&1))d=(s&1)+((s>>W)&1)+((s>>(2*W-1))&1)+((s>>(2*W))&1); ll e=0; if(i==H-1&&j>1&&C[i][j-1]>1&&!(s&1))e=((s>>1)&1)+((s>>(1+W))&1)+((s>>(W-1))&1)+((s>>W)&1); chmax(EP[(s<<1)&(sz(EP)-1)],DP[s]+(c>1)+(d>1)+(e>1)); if(S[i][j]=='.')chmax(EP[((s<<1)|1)&(sz(EP)-1)],DP[s]+(c>0)+(d>0)+(e>0)); } DP=EP; } cout<<*max_element(all(DP))<