Submission #8575099

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;

int main() {
    int h, w, k;
    char s[500][500];
    cin >> h >> w >> k;
    for (int i = 0; i < h; i++) cin >> s[i];

    bool fh = false;
    int ans[500][500], cnt = 1;
    for (int i = 0; i < h; i++) {
        int ichigo = 0;
        for (int j = 0; j < w; j++) ichigo += (s[i][j] == '#');
        if (ichigo == 0) {
            if (fh) {
                for (int j = 0; j < w; j++) ans[i][j] = ans[i - 1][j];
            }
        }
        else {
            int j = 0;
            while (j < w) {
                int sub = 0;
                while (j + sub < w && s[i][j + sub] == '.') {
                    sub++;
                }
                if (s[i][j + sub] == '#') {
                    for (int p = 0; p <= sub; p++) ans[i][j + p] = cnt;
                    cnt++;
                }
                else {
                    for (int p = j; p < w; p++) ans[i][p] = cnt - 1;
                }
                j += sub + 1;

            }
            if (!fh) {
                for (int p = 0; p < i; p++) {
                    for (int q = 0; q < w; q++) ans[p][q] = ans[i][q];
                }
            }
            fh = true;
        }
    }

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (j != 0) cout << " ";
            cout << ans[i][j];
        }
        cout << endl;
    }

}

Submission Info

Judge Result