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.
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.
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.
5 6 3 ****** *..*.* ****** *....* ****** 2 2 2 5 4 3
6 4 10
4 4 1 **** *..* *.** **** 3 2
8
题意:
在每个*与.之间都贴着一幅画,给一个点,问在这个点出发最多可以看到几幅画
思路:
预处理出每个点处画的位置,深搜或者宽搜,记录搜索的路径
坑点...不要用memset,会超时
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#define ll long long
using namespace std;
int n,m,k;
struct node
{
int x,y;
}zz;
queue<struct node>q;
char mp[1010][1010];
int num[1010][1010];
int dp[1010][1010];
int dir[4][2]={1,0,-1,0,0,1,0,-1};
bool vis[1010][1010];
int dfs(int x,int y)
{
zz.x=x;
zz.y=y;
q.push(zz);
int sum=0;
for(int k=0;k<4;k++)
{
int tx=x+dir[k][0];
int ty=y+dir[k][1];
if(tx>=1&&ty>=1&&tx<=n&&ty<=m)
{
if(mp[tx][ty]=='.'&&vis[tx][ty]==false)
{
vis[tx][ty]=true;
sum+=dfs(tx,ty);
}
}
}
return sum+num[x][y];
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=n;i++)
scanf(" %s",mp[i]+1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(mp[i][j]=='.')
{
for(int k=0;k<4;k++)
{
int tx=i+dir[k][0];
int ty=j+dir[k][1];
if(mp[tx][ty]=='*')
num[i][j]++;
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(mp[i][j]=='.'&&dp[i][j]==0)
{
vis[i][j]=true;
int d=dfs(i,j);
dp[i][j]=d;
while(!q.empty())
{
zz=q.front();
q.pop();
dp[zz.x][zz.y]=d;
}
}
}
}
while(k--)
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",dp[x][y]);
}
}