FZU - 1920 Left Mouse Button

时间：2015-04-24 09:02:32 阅读：247 评论：0 收藏：0 [点我收藏+]

FZU - 1920

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %I64d & %I64u

Description

Mine sweeper is a very popular small game in Windows operating system. The object of the game is to find mines, and mark them out. You mark them by clicking your right mouse button. Then you will place a little flag where you think the mine is. You click your left mouse button to claim a square as not being a mine. If this square is really a mine, it explodes, and you lose. Otherwise, there are two cases. In the first case, a little colored numbers, ranging from 1 to 8, will display on the corresponding square. The number tells you how many mines are adjacent to the square. For example, if you left-clicked a square, and a little 8 appeared, then you would know that this square is surrounded by 8 mines, all 8 of its adjacent squares are mines. In the second case, when you left-click a square whose all adjacent squares are not mines, then all its adjacent squares (8 of its adjacent squares) are mine-free. If some of these adjacent squares also come to the second case, then such deduce can go on. In fact, the computer will help you to finish such deduce process and left-click all mine-free squares in the process. The object of the game is to uncover all of the non-mine squares, without exploding any actual mines. Tom is very interesting in this game. Unfortunately his right mouse button is broken, so he could only use his left mouse button. In order to avoid damage his mouse, he would like to use the minimum number of left clicks to finish mine sweeper. Given the current situation of the mine sweeper, your task is to calculate the minimum number of left clicks. 技术分享

Input

The first line of the input contains an integer T (T <= 12), indicating the number of cases. Each case begins with a line containing an integer n (5 <= n <= 9), the size of the mine sweeper is n×n. Each of the following n lines contains n characters M _ij(1 <= i,j <= n), M _ij denotes the status of the square in row i and column j, where ‘@’ denotes mine, ‘0-8’ denotes the number of mines adjacent to the square, specially ‘0’ denotes there are no mines adjacent to the square. We guarantee that the situation of the mine sweeper is valid.

Output

For each test case, print a line containing the test case number (beginning with 1) and the minimum left mouse button clicks to finish the game.

Sample Input

Sample Output

Case 1: 24

扫雷，点到0点时所有连在一起的0都会显示出来，而且8个直接相邻的格子如果是数字也会显示出来，dfs处理出这一块，然后在枚举，累计所有未显示的数字就好了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int n;
vector<int> b;
int dir1[8]={0,0,-1,1,1,1,-1,-1};
int dir2[8]={-1,1,0,0,1,-1,1,-1};
char a[10][10];
bool vis[10][10];
void dfs(int x,int y)
{
	vis[x][y]=true;
	b.push_back(x*n+y);
	for(int i=0;i<8;i++)
	{
		int nx=x+dir1[i];
		int ny=y+dir2[i];
		if(nx>=0&&nx<n&&ny>=0&&ny<n&&vis[nx][ny]==false&&a[nx][ny]=='0')
		{
			dfs(nx,ny);
		}
	}
}
int main()
{
	int T;
	cin>>T;
	int t=1;
	while(T--)
	{
		cin>>n;
		memset(vis,false,sizeof(vis));
		for(int i=0;i<n;i++)
		{
			for(int k=0;k<n;k++)
			{
				cin>>a[i][k];
				if(a[i][k]=='@')
				{
					vis[i][k]=true;
				}
			}
		}
		int ans=0;
		b.clear();
		for(int i=0;i<n;i++)
		{
			for(int k=0;k<n;k++)
			{
				if(vis[i][k]==false&&a[i][k]=='0')
				{
					dfs(i,k);
					ans++;
				}
			}
		}
		for(int i=0;i<b.size();i++)
		{
			int x=b[i]/n;
			int y=b[i]%n;
			for(int k=0;k<8;k++)
			{
				int nx=x+dir1[k];
				int ny=y+dir2[k];
				if(nx>=0&&nx<n&&ny>=0&&ny<n&&vis[nx][ny]==false)
				{
					vis[nx][ny]=true;
				}
			}
		}
		for(int i=0;i<n;i++)
		{
			for(int k=0;k<n;k++)
			{
				if(!vis[i][k])
				{
					ans++;
				}
			}
		}
		printf("Case %d: %d\n",t++,ans);
	}
	return 0;
}

FZU - 1920 Left Mouse Button

原文：http://blog.csdn.net/qq_18738333/article/details/45237627

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)