zoukankan      html  css  js  c++  java
  • cf-Igor In the Museum (dfs)

     Igor In the Museum
    time limit per test
    1 second
    memory limit per test
    256 megabytes

    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 nm 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
    input
    5 6 3
    ******
    *..*.*
    ******
    *....*
    ******
    2 2
    2 5
    4 3
    output
    6
    4
    10
    input
    4 4 1
    ****
    *..*
    *.**
    ****
    3 2
    output
    8

    好吧, 我没读懂题;
    #include <cstdio>
    #include <cstring>
    #define M 1001
    int id, ans;
    int n, m;
    char G[M][M]; int v[M][M], r[M*M]; 
    int ac[4][2]={0, 1, 0, -1, -1, 0, 1, 0};
    void dfs(int x, int y)
    {
        v[x][y]=id;                 //标记数组; 
        for(int i=0; i<4; i++)
        {
            int nx=x+ac[i][0];
            int ny=y+ac[i][1];
            if(nx>0&&nx<=n&&ny>0&&ny<=m&&!v[nx][ny])
            {
                if(G[nx][ny]=='*')
                    ans++;
                else
                    dfs(nx, ny);
            }
        }
    }
    int main()
    {
        int k;
        while(scanf("%d%d%d", &n, &m, &k)!=EOF)
        {
            for(int i=1; i<=n; i++)
                scanf("%s", G[i]+1);
            memset(v, 0, sizeof(v));
            id=0;
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=m; j++)
                {
                    if(G[i][j]=='.'&&!v[i][j])
                    {
                        ans=0;
                        id++;
                        dfs(i, j);
                        r[id]=ans;    
                    //    printf("%d
    ", ans);                
                    }
                }
            }
            while(k--)
            {
                int x, y;
                scanf("%d%d", &x, &y);
                printf("%d
    ", r[v[x][y]]);
            }
        }
        return 0;
    }
  • 相关阅读:
    虚拟机备份的五大常见错误及规避方法
    交换机的link-dependency链路依赖功能
    IntelliJ Idea 常用快捷键列表
    Spark-1.X编译构建及配置安装
    maven快速下载jar镜像
    hive权威指南<一>
    vsftpd安装和使用 Linux系统和window系统
    git安装和使用 linux系统和window系统
    cdh版本的hue安装配置部署以及集成hadoop hbase hive mysql等权威指南
    cdh版本的sqoop安装以及配置
  • 原文地址:https://www.cnblogs.com/soTired/p/5247806.html
Copyright © 2011-2022 走看看