Igor In the Museum_igor is in the museum and he wants to see as many -CSDN博客

本文链接：https://blog.csdn.net/CSDN_PatrickStar/article/details/87560008

本文介绍了一个算法挑战，目标是在一个由空地和障碍组成的矩形博物馆中，从多个起始位置出发，寻找并计算可以看到的最大数量的画作。博物馆的地图以字符网格表示，算法通过深度优先搜索遍历所有可达的空地，同时计算遇到的每幅画作。最终，对于每个起始位置，算法返回可以看到的画作数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Igor is in the museum and he wants to see as many pictures as possible.

Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with ‘.’, impassable cells are marked with ‘*’. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.

At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.

For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture he can see.

Input
First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) — the museum dimensions and the number of starting positions to process.

Each of the next n lines contains m symbols ‘.’, ‘*’ — the description of the museum. It is guaranteed that all border cells are impassable, so Igor can’t go out from the museum.

Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) — the row and the column of one of Igor’s starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.

Output
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.

Examples
input
5 6 3

….*

…

2 2
2 5
4 3
output
6
4
10
input
4 4 1

…
.*

3 2
output
8

#include <iostream>
#include <cstring>
#define N 1001

using namespace std;

int n,m,k;
char s[N][N];
int cnt,num;
int vis[N][N],ans[N*N];
int step[4][2]={{0,1},{0,-1},{1,0},{-1,0}};

void dfs(int x,int y)
{
	int tx,ty;
	vis[x][y]=num;
	for(int i=0;i<4;i++)
	{
		tx=x+step[i][0];
		ty=y+step[i][1];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&!vis[tx][ty])
		{
			if(s[tx][ty]=='*')	cnt++;
			else	dfs(tx,ty);
		}
	}
}

int main()
{
    while(cin>>n>>m>>k)
    {
        for(int i=1;i<=n;i++)   cin>>s[i]+1;

        num=0;
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
			{
				if(s[i][j]=='.'&&!vis[i][j])
				{
					cnt=0;
					num++;
					dfs(i,j);
					ans[num]=cnt;
				}
			}
        }

		for(int i=1;i<=k;i++)
		{
			int x,y;
			cin>>x>>y;
			cout<<ans[vis[x][y]]<<endl;
		}
    }
    return 0;
}