zoukankan      html  css  js  c++  java
  • codeforces 598D Igor In the Museum

    D. Igor In the Museum

     

    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

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<queue>
     4 #include<algorithm>
     5 using namespace std;
     6 struct Node
     7 {
     8     int x,y;
     9 };
    10 int ans,n,m,k,tot;
    11 int d[4][2]={1,0,0,1,-1,0,0,-1};
    12 int vis[1005][1005],cnt[1005*1005];
    13 char map[1005][1005];
    14 void bfs(Node st)
    15 {
    16     queue<Node>q;
    17     q.push(st);
    18     vis[st.x][st.y]=tot;
    19     while(!q.empty())
    20     {
    21         Node t1=q.front();q.pop();
    22         for(int i=0;i<4;i++)
    23         {
    24             int xx=t1.x+d[i][0];
    25             int yy=t1.y+d[i][1];
    26             if(xx>=0&&xx<n&&yy>=0&&yy<m)
    27             {
    28                 if(map[xx][yy]=='*')cnt[tot]++;
    29                 else if(!vis[xx][yy])vis[xx][yy]=tot,q.push((Node){xx,yy});
    30             }
    31         }
    32     }
    33 }
    34 int main()
    35 {
    36     scanf("%d%d%d",&n,&m,&k);
    37     for(int i=0;i<n;i++)
    38         scanf("%s",map[i]);
    39     for(int i=0;i<n;i++)
    40         for(int j=0;j<m;j++)
    41             if(!vis[i][j]&&map[i][j]=='.')
    42             {
    43                 tot++;
    44                 bfs((Node){i,j});
    45             }
    46     while(k--)
    47     {
    48         int sx,sy;
    49         scanf("%d%d",&sx,&sy);
    50         sx--,sy--;
    51         printf("%d
    ",cnt[vis[sx][sy]]);
    52     }
    53     return 0;
    54 }
  • 相关阅读:
    UML常见工具之Powerdesigner
    在webForm中WebRequest\WebClient\WebBrowser获取远程页面源码的三种方式(downmoon)
    忍不住了,我来说两句,从一道面试题说起
    《UML用户指南第二版》再次温读笔记(一)(downmoon)
    Database Project requires local SQL 2005 instance的解决方案(downmoon)
    JDBC Driver For SQL2000/2005/2008
    服务器更新dll后导致网站崩溃,重启iis也无效的一种解决方案(downmoon)
    白孩儿一个网上流传的故事[生活感悟]
    vs2008中js的语法提示及修正功能(downmoonn)
    Contoso 大学 2 – 实现基本的增删改查
  • 原文地址:https://www.cnblogs.com/homura/p/4988081.html
Copyright © 2011-2022 走看看