Submission #8577941

---

Source Code Expand

#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <numeric>
#include <assert.h>
#include <bitset>
#include <list>
#include <cmath>

auto& in = std::cin;
auto& out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI = 3.141592653589793238462643383279502884197169399375105820974944;

int H, W;
int K;
char map[400][400];
int res[400][400];

template<typename T>void imos2d(int32_t x, int32_t y, int32_t x2, int32_t y2, T& arr)
{
	++arr[x][y];
	--arr[x][y2];
	--arr[x2][y];
	++arr[x2][y2];
}


int main()
{
	using std::endl;
	in.sync_with_stdio(false);
	out.sync_with_stdio(false);
	in.tie(nullptr);
	out.tie(nullptr);

	in >> H >> W >> K;
	for (size_t i = 0; i < H; i++)
	{
		in >> map[i];
	}

	int count = 1;
	int lasth = -1;
	for (int i = 0; i < H; i++)
	{
		int lastw = -1;
		bool updated = false;
		for (int j = 0; j < W; j++)
		{
			if (map[i][j] == '#') {
				
				updated = true;

				res[lasth + 1][lastw + 1] += count;
				res[lasth + 1][j+1] -= count;
				res[i + 1][lastw + 1] -= count;
				res[i + 1][j + 1] += count;

				lastw = j;
				++count;
			}
		}
		if (updated) {
			res[lasth + 1][lastw + 1] += count-1;
			res[lasth + 1][W] -= count - 1;
			res[i + 1][lastw + 1] -= count - 1;
			res[i + 1][W] += count - 1;

			lasth = i;
		}
	}

	for (int i = 0; i < H; i++)
	{
		for (int j = 1; j < W; j++)
		{
			res[i][j] += res[i][j - 1];
		}
	}
	for (int i = 1; i < H; i++)
	{
		for (int j = 0; j < W; j++)
		{
			res[i][j] += res[i - 1][j];
		}
	}

	for (int i = lasth+1; i < H; i++)
	{
		for (int j = 0; j < W; j++)
		{
			assert(res[i][j]==0);
			res[i][j] += res[i - 1][j];
		}
	}

	for (int i = 0; i < H; i++)
	{
		for (int j = 0; j < W-1; j++)
		{
			out << res[i][j] << ' ';
		}
		out << res[i][W - 1] << '\n';
	}




	return 0;
}
#endif

Submission Info

Judge Result