Codeforces 598DIgor In the Museum （BFS加离线优化）

D. Igor In the Museum

time limit per test 1 second

memory limit per test 256 megabytes

input standard input

output  standard output

题目链接： http://codeforces.com/problemset/problem/598/D

 

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.

Sample test(s)

Input

5 6 3
******
*..*.*
******
*....*
******
2 2
2 5
4 3

Output

6
4
10

Input

4 4 1
****
*..*
*.**
****
3 2

Output

8

 

题目大意： 给你一个n * m  这样的字符，字符由'.'和'*'组成  '.'是可以走的路  '*'是不可以走。然后会有k次询问 每次询问会输出一个答案。 询问就是问  你站在(x,y)这个点上，然后问你在你可走的区域之内最多可以看到几个'*‘.所以大家不难想到用BFS来写

只时候大家看第二个样例就会纠结一下，因为有个小坑点，一个'*'从它的四个方向看是算不同的。  因为询问次数过多，每一次BFS 时间复杂度太高，所以把一堆可以通的道路全部初始化，之后每次询问就可以直接输出答案了。

#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
char map[1010][1010];           //地图嘛
int vis[1010][1010];            //访问标记
int dir[4][2] = {0,1,0,-1,1,0,-1,0};        //四个方向
int res[1010][1010];             //记录每个'.'的结果
int ans;                    //记录临时的结果
int n,m,q;                  //n行 m列 q 次询问
struct state
{
    int x,y;            //记录坐标
    char c;             //记录是'.'还是'*'
}sta[1000010];

int check(state s)
{
    if ( vis[s.x][s.y] == 0 && s.x >= 0 &&s.x < n && s.y >= 0 && s.y < m && (s.c =='.'))        //判断师傅符合条件
    {
        return 1;
    }
    else 
    {
        if ( s.c == '*')        //如果这路不通又是'*'，因为点的四个方向算不同，所以不用怕会重复
            ans++;
        return 0;
    }
}
queue <state> h;            //记录连通的道路
void bfs(state s)
{
    queue <state> q;
    state now,next;     
    q.push(s);          
    h.push(s);
    vis[s.x][s.y] = 1;      //访问过了，标记
    while (!q.empty())      
    {
        now = q.front();       //队首元素
        q.pop();
        for ( int i = 0 ; i < 4 ;i++)
        {
            next.x = now.x + dir[i][0];
            next.y = now.y + dir[i][1];
            next.c = map[next.x][next.y];
            if (check(next))
            {
                q.push(next);
                h.push(next);           //连通的路，入队
                vis[next.x][next.y] = 1;
            }
        }
        
    }
    return;         //无路可走了，自动退出
}
int main()
{

    scanf("%d%d%d",&n,&m,&q);
    memset(res,0,sizeof(res));
        memset(vis,0,sizeof(vis));
        ans = 0;
        getchar();
        int l = 1;
        for (int  i = 1 ; i <= n ; i++ )
        {
            for ( int j = 1 ; j <= m ; j++ )
            {
                scanf("%c",&sta[l].c);
                map[i][j] = sta[l].c;
                sta[l].x = i;
                sta[l].y = j;
                l++;
            }
            getchar();
        }
        for (int  i = 1 ; i < l ; i++ )
        {
            if ( sta[i].c == '.' && vis[sta[i].x][sta[i].y] == 0)       //该点没被访问过，bfs
            {
                bfs(sta[i]);
                while(!h.empty())                   
                {
                    state p = h.front();
                    h.pop();
                    res[p.x][p.y] = ans;            //将连在一片的点。全部赋予最大的答案。
                    vis[p.x][p.y] = 1;
                }
                ans = 0;
            }
        }
        for(int i = 0 ; i < q ; i++ )
        {
            int x,y;
            scanf("%d%d",&x,&y);                //之后直接询问
            //printf("%d %d\n",sta[(x-1)*m+y].x,sta[(x-1)*m+y].y);
                printf("%d\n",res[x][y]);
                continue;
            //getchar();
        }
            
    
    return 0;   
}