搜索04 Mine Sweeper

题目链接

Description

The game Minesweeper is played on an n by n grid. In this grid are hidden m mines, each at a distinct grid location. The player repeatedly touches grid positions. If a position with a mine is touched, the mine explodes and the player loses. If a positon not containing a mine is touched, an integer between 0 and 8 appears denoting the number of adjacent or diagonally adjacent grid positions that contain a mine. A sequence of moves in a partially played game is illustrated below. 
 
Here, n is 8, m is 10, blank squares represent the integer 0, raised squares represent unplayed positions, and the figures resembling asterisks represent mines. The leftmost image represents the partially played game. From the first image to the second, the player has played two moves, each time choosing a safe grid position. From the second image to the third, the player is not so lucky; he chooses a position with a mine and therefore loses. The player wins if he continues to make safe moves until only m unplayed positions remain; these must necessarily contain the mines. 

Your job is to read the information for a partially played game and to print the corresponding board. 

Input

The first line of input contains a single postitive integer n <= 10. The next n lines represent the positions of the mines. Each line represents the contents of a row using n characters: a period indicates an unmined positon while an asterisk indicates a mined position. The next n lines are each n characters long: touched positions are denoted by an x, and untouched positions by a period. The sample input corresponds to the middle figure above.

Output

Your output should represent the board, with each position filled in appropriately. Positions that have been touched and do not contain a mine should contain an integer between 0 and 8. If a mine has been touched, all positions with a mine should contain an asterisk. All other positions should contain a period.

Sample Input

8
...**..*
......*.
....*...
........
........
.....*..
...**.*.
.....*..
xxx.....
xxxx....
xxxx....
xxxxx...
xxxxx...
xxxxx...
xxx.....
xxxxx...

Sample Output

001.....
0013....
0001....
00011...
00001...
00123...
001.....
00123...

描述

难点在于对题目的理解，使用普通的搜索就行。

#include<cstdio>
using namespace std;
char map[11][11],visit[11][11];
int count[11][11],n;
int dx[8]= {-1,-1,-1,0, 0,1,1, 1}; //这里定义8个方向
int dy[8]= {-1, 0, 1,1,-1,1,0,-1};
int bflag=0;
void clear() {
	for(int i=0; i<11; i++) for(int j=0; j<11; j++) count[i][j]=0;
}
void search(int x,int y) {//雷的位置是(x,y),从雷的位置出发，对雷周围的8个方格处理 
	for(int i=0; i<8; i++) {
		int tx = x+dx[i];
		int ty = y+dy[i];
		if(tx<0||tx>=n||ty<0||ty>=n) continue;
		if(visit[tx][ty]=='x') {
			count[tx][ty]++;
		}
	}
}
int main() {
	//freopen("in.txt","r",stdin);
	while(scanf("%d",&n)!=EOF) {
		bflag=0;
		clear();
		getchar();
		for(int i=0; i<n; i++) {//输入雷区分布图 
			for(int j=0; j<n; j++) {
				scanf("%c",&map[i][j]);
			}
			getchar();
		}
		for(int i=0; i<n; i++) {//输入已经踩过的区域 
			for(int j=0; j<n; j++) {
				scanf("%c",&visit[i][j]);
			}
			getchar();
		}
		for(int i=0; i<n; i++) {//搜寻含有雷的位置，进行计数统计 
			for(int j=0; j<n; j++) {
				if(map[i][j]=='*') {
					if(visit[i][j]=='x') bflag=1;
					search(i,j);
				}
			}
		}
		for(int i=0; i<n; i++) {//对vis数组进行进一步的处理 
			for(int j=0; j<n; j++) {
				if(bflag) {//如果碰到了雷 
					if(map[i][j]=='*') visit[i][j]='*';
					else {
						if(visit[i][j]=='x') visit[i][j]='0'+count[i][j];
					}
				} else {
					if(visit[i][j]=='x') visit[i][j]='0'+count[i][j];
				}
			}
		}
		for(int i=0; i<n; i++) {
			for(int j=0; j<n; j++) {
				printf("%c",visit[i][j]);
			}
			printf("\n");
		}
	}
	return 0;
}