November 11th UVALive - 7512

题就不打了，题意就是问不相邻的最多种坐法和最少种坐法，直接每行每行的模拟即可！

#include <stdio.h>
#include <string.h>
int a[1005][1005];
int main() {
	int N,_ = 1;
	scanf("%d",&N);
	while(N--) {
		memset(a, 0, sizeof(a));
		
		int n , m , z , x, y ,t ,sum1 = 0 , sum2 = 0;
		scanf("%d %d",&n,&m);
		scanf("%d",&z);
		for(int i = 0; i < z; i++) {
			scanf("%d %d",&x,&y);
			a[x][y] = 1;
		}
		t = 0;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				if(a[i][j] != 1) {
					t++;
				}
				if(a[i][j] == 1 || j == m-1){
					sum1 += (t+1)/2;
					sum2 += (t+2)/3;
					t = 0;
				}
			}
		}
		printf("Case #%d: ",_++);
		printf("%d %d\n",sum1 , sum2);
	}
	return 0;
}