#include "bits/stdc++.h" #include #include #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define SZ(x) ((lint)(x).size()) #define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i=i##_begin_;--i) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) #define endk '\n' using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair plint; typedef pair pld; struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_; template auto add = [](T a, T b) -> T { return a + b; }; template auto mul = [](T a, T b) -> T { return a * b; }; template auto f_max = [](T a, T b) -> T { return max(a, b); }; template auto f_min = [](T a, T b) -> T { return min(a, b); }; template using V = vector; using Vl = V; using VVl = V; using VVVl = V>; template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : ""); return os; } template< typename T >istream& operator>>(istream& is, vector< T >& v) { for (T& in : v) is >> in; return is; } template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } template T div_floor(T a, T b) { if (b < 0) a *= -1, b *= -1; return a >= 0 ? a / b : (a + 1) / b - 1; } template T div_ceil(T a, T b) { if (b < 0) a *= -1, b *= -1; return a > 0 ? (a - 1) / b + 1 : a / b; } template struct rec { F f; rec(F&& f_) : f(std::forward(f_)) {} template auto operator()(Args &&... args) const { return f(*this, std::forward(args)...); } }; lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); } lint digit(lint a) { return (lint)log10(a); } lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); } lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); } bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); } const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e18; lint dx[8] = { 0, 1, 0, -1, 1, -1, -1, 1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 }; bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; } struct Edge { lint from, to; lint cost; Edge() { } Edge(lint u, lint v, lint c) { cost = c; from = u; to = v; } bool operator<(const Edge& e) const { return cost < e.cost; } }; typedef pair tlint; typedef pair pld; typedef pair qlint; typedef pair pEd; typedef pair> vVl; typedef pair pstr; typedef pair pint; #include using namespace atcoder; using S = long long; using F = long long; const F ID = 8e15; S op(S a, S b) { return std::min(a, b); } S e() { return INF; } S mapping(F f, S x) { return (f == ID ? x : f); } F composition(F f, F g) { return (f == ID ? g : f); } F id() { return ID; } void solve() { lint N, M; cin >> N >> M; V arr(N); cin >> arr; reverse(ALL(arr)); vector prv(M), v1(M, ID); REP(i, N) { set st; REP(j, M) st.insert({ prv[j], j }); lazy_segtree seg(v1); Vl lock; lock.push_back(-INF); REP(j, M) if (arr[i][j] == '#') lock.push_back(j); lock.push_back(INF); while (!st.empty()) { auto itr = *st.rbegin(); auto itr_l = lower_bound(ALL(lock), itr.second); itr_l--; lint l = max(-1ll, *itr_l); auto itr_r = lower_bound(ALL(lock), itr.second); lint r = min(M, *itr_r); seg.apply(max(l + 1, itr.second - itr.first), min(r, itr.second + itr.first + 1), itr.first); st.erase(itr); } V nxt(M); REP(j, M) nxt[j] = seg.get(j); REP(j, M - 1) { if (arr[i][j] != '#') chmin(nxt[j + 1], nxt[j] + 1); } IREP(j, M - 1) { if (arr[i][j + 1] != '#') chmin(nxt[j], nxt[j + 1] + 1); } REP(j, M) { if (i == N - 1) { if (arr[i][j] == '#') nxt[j] = ID; } else { if (arr[i + 1][j] == '#' || arr[i][j] == '#') nxt[j] = ID; } } swap(nxt, prv); } REP(i, M) cout << prv[i] << endk; } int main() { lint T = 1; //cin >> T; while (T--) solve(); }