Educational Codeforces Round 1 D. Igor In the Museum

D. Igor In the Museum

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

题意：给你一个图， 在每一个'.'和'*'之间放了一副画，给你一个点求那个地方（只要'.'相连的区域)的画的数目。

直接模拟肯定会超时，所以我们要先如预处理。

我用dfs求每一个地区画的数目，然后用在对每一个点都赋这个值。

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

const int N = 1001;
char str[N][N];
int dir[4][2] = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} };
int n, m ,k;

int vis[N][N];
int ans[N][N];

int dfs(int x, int y)
{
    int ans = 0;
    int i;
    for(i = 0; i < 4; i++)
    {
        int xx = x + dir[i][0];
        int yy = y + dir[i][1];
        if(0 <= xx && xx < n && 0 <= yy && yy < m )
        {
            if(str[xx][yy] == '.')
            {
                if(!vis[xx][yy])
                {
                    vis[xx][yy] = 1;
                    ans += dfs(xx, yy);
                }
            }
            else ans++;
        }
    }
    return ans;
}

int dfs1(int x, int y, int val)
{
    int i;
    for(i = 0; i < 4; i++)
    {
        int xx = x + dir[i][0];
        int yy = y + dir[i][1];
        if(0 <= xx && xx < n && 0 <= yy && yy < m )
        {
            if(vis[xx][yy] && !ans[xx][yy])
            {
                ans[xx][yy] = val;
                dfs1(xx, yy, val);
            }
        }
    }
    return 0;
}


int main(void)
{
    int i, j;
    scanf("%d%d%d", &n, &m, &k);
    for(i = 0; i < n; i++)
    {
        scanf("%s", str[i]);
    }
    memset(vis, 0, sizeof(vis));
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < m; j++)
        {
            if(str[i][j] == '.' && !vis[i][j])
            {
                vis[i][j] = 1;
                ans[i][j] = dfs(i, j);
                dfs1(i, j, ans[i][j]);
            }
        }
    }
    while(k--)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        printf("%d\n", ans[x-1][y-1]);
    }
    return 0;
}