#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #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) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b>W>>H; vectorS(H);cin>>S; vector>DP(H,vector(W,1e18)),m={{1,0},{0,1},{-1,0},{0,-1}}; REP(i,H)REP(j,W)if(S[i][j]=='.'){ if(DP[i][j]==1e18){ queueX,Y; X.emplace(i);Y.emplace(j); DP[i][j]=0; while(sz(X)){ ll x=X.front(),y=Y.front(); X.pop();Y.pop(); REP(_,4){ ll dx=x+m[_][0],dy=y+m[_][1]; if(min({dx,H-1-dx,dy,W-1-dy})<0)continue; if(chmin(DP[dx][dy],DP[x][y]+(S[dx][dy]=='#'))){X.emplace(dx);Y.emplace(dy);} } } } else if(DP[i][j]){cout<