Submission #1531052

---

Source Code Expand

#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <ctime>
#include <map>
#include <stack>
#include <sstream>

using namespace std;

map <pair<long long int, long long int>, int> painted;
//색칠된 좌표를 (0,0)으로 해서 그 블락에 몇개나 색칠되어있는지를 체크.
int counting(long long int x, long long int y)
{
	int res = 0;

	for (long long int i = y; i <= y + 2; i++)
	{
		for (long long int j = x; j <= x + 2; j++)
		{
			if (painted[make_pair(i, j)] == 1)
			{
				res += 1;
			}
		}
	}

	return res;
}
int main(void)
{
	long long int count[10] = { 0, };
	long long int H, W, N;
	long long int a, b;
	cin >> H >> W >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> a >> b;
		painted[make_pair(a,b)] = 1;
	}
	//아무것도 색칠되지 않았다고 설정.
	count[0] = (H - 2)*(W - 2);

	//블락에 몇개나 색칠되어 있는지 확인.
	for (auto it = painted.begin(); it != painted.end(); it++)
	{
		int res;
		long long int x = it->first.second;
		long long int y = it->first.first;
		if (y > H - 2 || x > W - 2)
		{
			continue;
		}
		res = counting(x, y);
		//0이면 안해도 됨.
		if (res != 0)
		{
			count[res] += 1;
			count[0] -= 1;
		}
	}

	for (int i = 0; i < 10; i++)
	{
		cout << count[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result