Submission #56173323

---

Source Code Expand

#ifndef INCLUDED_MAIN
#define INCLUDED_MAIN

#include __FILE__

mint rev2 = ((mint)2).inv();

int main(){
    ll H, W, K;
    cin >> H >> W >> K;
    vector<vector<ll>> A(H,vector<ll>(W));
    ll id = 1;
    rep(i,H){
        string S;
        cin >> S;
        rep(j,W){
            char c = S[j];
            if(c=='#'){
                A[i][j]=id;
                id++;
            }
        }
        cout << endl;
    }

    // 右から左へ
    // j-1を更新
    rep(i,H){
        for(int j=W-1;j>0;j--){
            if(!A[i][j-1]){
                A[i][j-1]=A[i][j];
            }
        }
    }
    // 左から右へ
    // j+1を更新
    rep(i,H){
        rep(j,W-1){
            if(!A[i][j+1]){
                A[i][j+1]=A[i][j];
            }
        }
    }
    
    // 下から上へ
    // i-1を更新
    rep(j,W){
        for(int i=H-1;i>0;i--){
            if(!A[i-1][j]){
                A[i-1][j]=A[i][j];
            }
        }
    }

    // 上から下へ
    // i+1を更新
    rep(j,W){
        rep(i,H-1){
            if(!A[i+1][j]){
                A[i+1][j]=A[i][j];
            }
        }
    }
    for(vector<ll> arr : A){
        bool flg = false;
        for(ll tmp: arr){
            if(flg) cout << " ";
            flg = true;
            cout << tmp;
        }
        cout << endl;
    }
}

#else
#include<bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define reps(i,s,n) for(ll i=(s); i<(n); i++)
#define all(x) (x).begin(),(x).end()
#define lb_ind(a,key) lower_bound(all((a)), (key)) - (a).begin()
#define llvec(a,n) vector<ll> (a)((n))
#define yn(flg) cout<<(flg?"Yes":"No")<<endl;

using mint = modint998244353;


#endif

Submission Info

Judge Result