Submission #880566

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<cstdio>
#include<cstring>
#include<set>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x).size())
#define rep(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef pair<int,int> pii;
const int N = 1e5 + 7;
//-------head---------
const int dx[] = { -1, -1, -1, 0, 0, 0, 1, 1, 1 };
const int dy[] = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
int h, w, n;
set<pii> S;
set<pii>::iterator it;
ll ans[10];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<cstdio>
#include<cstring>
#include<set>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x).size())
#define rep(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef pair<int,int> pii;
const int N = 1e5 + 7;
//-------head---------
const int dx[] = { -1, -1, -1, 0, 0, 0, 1, 1, 1 };
const int dy[] = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
int h, w, n;
set<pii> S;
set<pii>::iterator it;
ll ans[10];
int calc(int sx, int sy) {
	int ret = 0;
	rep(i, 0, 9) {
		int x, y;
		x = sx + dx[i];
		y = sy + dy[i];
		if (S.find(mp(x, y)) != S.end())
			++ret;
	}
	return ret;
}
void solve() {
	for (it = S.begin(); it != S.end(); ++it) {
		rep(i, 0, 9) {
			int x, y;
			x = it->first + dx[i];
			y = it->second + dy[i];
			if (x < 2 || x > h - 1 || y < 2 || y > w - 1)
				continue;
			++ans[calc(x, y)];
		}
	}
	ans[0] = 1ll * (h -2) * (w - 2);
	rep(i, 1, 10) {
		ans[i] /= i;
		ans[0] -= ans[i];
	}
}
int main() {
	cin >> h >> w >> n;
	rep(i, 0, n) {
		int a, b;
		cin >> a >> b;
		S.insert(mp(a, b));
	}
	solve();
	rep(i, 0, 10)
		cout << ans[i] << endl;
	return 0;
}

Submission Info

Judge Result