2217.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2217 on 2006-04-26 at 12:28:18 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int SN = 204800;

class Stone {
public:
	int x, y;
	void make();
	bool operator <(const Stone&) const;
};
void Stone::make() {
	scanf("%d %d", &x, &y);
}
bool Stone::operator <(const Stone& s) const {
	if(x != s.x) return x < s.x;
	else return y < s.y;
}

Stone stone[SN];

int main()
{
	int n, m, k, col[SN];
	int t, T, i;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		scanf("%d %d %d", &n, &m, &k);
		memset(col, 0, sizeof(col));
		for(i = 0; i < k; i++) stone[i].make();
		int cnt = 0, sn = 0;
		sort(stone, stone+k);
		for(i = 1; i <= n; i++) {
			int left = 0;
			for(; sn < k && stone[sn].x == i; sn++) {
				if(stone[sn].y-left >= 3) cnt++;
				left = stone[sn].y;
				if(i-col[stone[sn].y] >= 3) cnt++;
				col[stone[sn].y] = i;
			}
			if(m+1-left >= 3) cnt++;
		}
		for(i = 1; i <= m; i++)
			if(n+1 - col[i] >= 3) cnt++;
		printf("%d\n", cnt);
	}
	
	return 0;
}