POJ 1164 The Castle

Description

     1   2   3   4   5   6   7  

   #############################

 1 #   |   #   |   #   |   |   #

   #####---#####---#---#####---#

 2 #   #   |   #   #   #   #   #

   #---#####---#####---#####---#

 3 #   |   |   #   #   #   #   #

   #---#########---#####---#---#

 4 #   #   |   |   |   |   #   #

   #############################

(Figure 1)



#  = Wall   

|  = No wall

-  = No wall

Figure 1 shows the map of a castle.Write a program that calculates
1. how many rooms the castle has
2. how big the largest room is
The castle is divided into m * n (m<=50, n<=50) square modules. Each such module can have between zero and four walls.

Input

Your program is to read from standard input. The first line contains the number of modules in the north-south direction and the number of modules in the east-west direction. In the following lines each module is described by a number (0 <= p <= 15). This number is the sum of: 1 (= wall to the west), 2 (= wall to the north), 4 (= wall to the east), 8 (= wall to the south). Inner walls are defined twice; a wall to the south in module 1,1 is also indicated as a wall to the north in module 2,1. The castle always has at least two rooms.

Output

Your program is to write to standard output: First the number of rooms, then the area of the largest room (counted in modules).

Sample Input

4
7
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13

Sample Output

5
9

题目描述：

　　有一个n*m的castle，有一个个小房间组成，每个房间由一个零和四面的墙组成，每个房间都有一个价值，

价值的计算方式是：west_walls价值为1，north_walls价值为2，east_walls价值为4，south_walls价值为8，

walls的价值加在一起就是这个房间的价值。先输入n，m，随后输入n*m的数字矩阵。问castle有几个房间，最大的房间多大？

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int map[55][55],n,m,num,sum;
int d[4][2]={{0,-1},{-1,0},{0,1},{1,0}};
void dfs(int x,int y){
	sum++;
	int s=map[x][y];
	map[x][y]=-1;
	for(int i=0;i<4;i++){
		if(s%2==0){
			int nx=x+d[i][0];
			int ny=y+d[i][1];
			if(nx>=0 && nx<n && ny>=0 && ny<m && map[nx][ny]!=-1){
				dfs(nx,ny);
			}
		}
		s/=2;
	}
}
int main(){
	int i,j,k,maxn;
	while(scanf("%d%d",&n,&m)!=EOF){
		for(i=0;i<n;i++)	
			for(j=0;j<m;j++)
				cin>>map[i][j];
		num=maxn=0;
		for(i=0;i<n;i++)
			for(j=0;j<m;j++){
				if(map[i][j]!=-1){
					sum=0;
					dfs(i,j);
					num++;
					maxn=max(maxn,sum);
				}
			}
		cout<<num<<endl<<maxn<<endl;
	}
	return 0;
}