#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&&y>3)&1)){ { ll c=(s&1)+((s>>2)&1)+((s>>5)&1)+((s>>6)&1); F11[s]+=(c>1); G11[s]+=(c>0); } { ll c=(s&1)+((s>>1)&1)+((s>>2)&1)+((s>>4)&1)+((s>>5)&1)+((s>>6)&1)+((s>>7)&1); F12[s]+=(c>1); G12[s]+=(c>0); } } if(!((s>>2)&1)){ ll c=(s&1)+((s>>3)&1)+((s>>5)&1)+((s>>6)&1); F2[s]+=(c>1); G2[s]+=(c>0); } if(!(s&1)){ ll c=((s>>1)&1)+((s>>2)&1)+((s>>3)&1)+((s>>4)&1); F3[s]+=(c>1); G3[s]+=(c>0); } } vl F(256),G(256); rep(i,0,H)rep(j,0,W){ rep(s,0,256){ F[s]=G[s]=0; if(j&&i&&C[i-1][j-1]>1){ if(j==1)F[s]=F11[s],G[s]=G11[s]; else F[s]=F12[s],G[s]=G12[s]; } if(j==W-1&&i&&C[i-1][j]>1)F[s]+=F2[s],G[s]+=G2[s]; if(i==H-1&&j>1&&C[i][j-1]>1)F[s]+=F3[s],G[s]+=G3[s]; } rep(s,0,1<<(2*W+1)){ ll t=(s&3)|(((s>>(W-1))&7)<<2)|(((s>>(2*W-1))&7)<<5); EP[s<<1]=max(DP[s]+F[t],DP[s|(1<<(2*W+1))]+F[t|128]); if(S[i][j]=='.')EP[(s<<1)|1]=max(DP[s]+G[t],DP[s|(1<<(2*W+1))]+G[t|128]); else EP[(s<<1)|1]=-1e18; } DP=EP; } cout<<*max_element(all(DP))<