#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template ostream &operator<<(ostream &os, const pair &p){ os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v){ for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template void out(const vector> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector dx = {0,1,0,-1,1,1,-1,-1}; const vector dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template T gcd_fast(T a, T b){ return static_cast(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast((n ^ d) < 0 && n % d != 0); } template T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast((n ^ d) >= 0 && n % d != 0); } template void uniq(vector &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair; using pll = pair; using pil = pair; using pli = pair; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" namespace ebi { template struct dual_segtree { private: void all_apply(int i, F f) { d[i] = merge(f, d[i]); } void push(int i) { assert(i < sz); all_apply(2 * i, d[i]); all_apply(2 * i + 1, d[i]); d[i] = id(); } public: dual_segtree(int n_) : dual_segtree(std::vector(n_, id())) {} dual_segtree(const std::vector &a) : n(a.size()), sz(std::bit_ceil(a.size())), lg2(std::countr_zero((unsigned int)(sz))) { d = std::vector(2 * sz, id()); for (int i : std::views::iota(sz, sz + n)) { d[i] = a[i - sz]; } } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= n); if (l == r) return; l += sz; r += sz; for (int i : std::views::iota(1, lg2 + 1) | std::views::reverse) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } } F get(int p) { assert(0 <= p && p < n); p += sz; for (int i : std::views::iota(1, lg2 + 1) | std::views::reverse) { push(p >> i); } return d[p]; } private: int n, sz, lg2; std::vector d; }; } // namespace ebi int op(int a, int b){ return min(a,b); } int e(){ return iinf; } void solve(){ int h, w; in(h,w); vector a(h); in(a); vector dp(w,0); reb(i,h-1){ rep(j,w){ if (a[i][j] == '#'){ dp[j] = iinf; } } ebi::dual_segtree down(w), hor(w), up(w); rep(j,w){ if (dp[j] == iinf) continue; // [l, r] int l = max(0,j-dp[j]); int r = min(w-1,j+dp[j]); down.apply(0,l,dp[j]+l); hor.apply(l,r+1,dp[j]); up.apply(r+1,w,dp[j]-r); } rep(j,w){ if (a[i][j] == '#'){ dp[j] = iinf; } else { dp[j] = min({-j+down.get(j),hor.get(j),j+up.get(j)}); } } } rep(j,w) out(dp[j]); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }