Colorindo - Roger Benet

colorindo_benet.cpp

#include <cstdio>
#define MAX 210

int matrix[MAX][MAX];
int n,m,k,x,y;

void dfs(int i, int j){
	if(i >= 1 && i <= n && j >= 1 && j <= m){
		if(matrix[i][j] == 0)matrix[i][j] = 1;
		if(matrix[i-1][j-1] == 0){
			matrix[i-1][j-1] = 1;
			dfs(i-1,j-1);
		}
		if(matrix[i-1][j] == 0){
			matrix[i-1][j] = 1;
			dfs(i-1,j);
		}
		if(matrix[i-1][j+1] == 0){
			matrix[i-1][j+1] = 1;
			dfs(i-1,j+1);
		}
		if(matrix[i][j-1] == 0){
			matrix[i][j-1] = 1;
			dfs(i,j-1);
		}
		if(matrix[i][j+1] == 0){
			matrix[i][j+1] = 1;
			dfs(i,j+1);
		}
		if(matrix[i+1][j-1] == 0){
			matrix[i+1][j-1] = 1;
			dfs(i+1,j-1);
		}
		if(matrix[i+1][j] == 0){
			matrix[i+1][j] = 1;
			dfs(i+1,j);
		}
		if(matrix[i+1][j+1] == 0){
			matrix[i+1][j+1] = 1;
			dfs(i+1,j+1);
		}	
	}
}

int main(){
	
	scanf("%d %d %d %d %d", &n ,&m, &x, &y, &k);
	
	while(k--){
		int a,b;
		scanf("%d %d", &a, &b);
		matrix[a][b] = -1;
	}
	
	dfs(x,y);
	
	k = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(matrix[i][j] == 1)k++;
		}	
	}
	
	printf("%d\n",k);
	return 0;
}