CF 598D Igor In the Museum【DFS】

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

题目大意：
星号是墙 实点是路
输入n行m列然后还有小明所在的k组坐标（所有坐标的计算都是从1开始）
墙的紧靠着路的那一面有画，小明只能走路（就是实点）不能穿墙（不能走星号）问小明最多能看多少幅画

简单的搜索题就是直接套用dfs模板（mdzz这道题怎么就藏在了最后面呢）
从输入的坐标开始，上下左右开始搜索，遇到墙就ans++；遇到路就走过去再次搜索；记得vis数组更新

#include<iostream>
#define MAXN 1005
using namespace std;
char maze[MAXN][MAXN];
int n,m,k;
int vis[MAXN][MAXN];
int ans[100005];
int cnt=0;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void dfs(int x,int y)
{
vis[x][y]=cnt;
for(int i=0;i<4;i++)
{
int nx=x+dx[i];
int ny=y+dy[i];
if(maze[nx][ny]=='*')
        ans[cnt]++;
if(maze[nx][ny]=='.'&&vis[nx][ny]==0)
       dfs(nx,ny);
}
return;}

int main()
{ cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{for(int j=1;j<=m;j++)
{cin>>maze[i][j];}}
for(int i=0;i<k;i++)
{int x,y;
cin>>x>>y;
if(vis[x][y])
   cout<<ans[vis[x][y]]<<endl;
 else
 {cnt++;
 dfs(x,y);
 cout<<ans[cnt]<<endl;}}
 return 0;}