zoukankan      html  css  js  c++  java
  • Igor In the Museum(搜搜搜151515151515******************************************************1515151515151515151515)

    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.

    Examples
    input
    5 6 3 ****** *..*.* ****** *....* ****** 2 2 2 5 4 3
    output
    6 4 10
    input
    4 4 1 **** *..* *.** **** 3 2
    output
    8
    题解:我去他个jj,这15组数据跟我有仇,最后一组数据啊。为毛。。。。。。。大神们求解啊,疯了。。。。。
    今天看了大神的写法,感觉处理的很是巧妙;学习了;
    修改ac的代码:
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    const int INF=0x3f3f3f3f;
    #define mem(x,y) memset(x,y,sizeof(x))
    #define SI(x) scanf("%d",&x)
    #define PI(x) printf("%d",x)
    #define P_ printf(" ")
    int n,m,k;
    const int MAXN=2010;
    char mp[MAXN][MAXN];
    int vis[MAXN][MAXN];
    int ans,tp;
    int disx[4]={0,0,1,-1};
    int disy[4]={1,-1,0,0};
    int dp[10001000];
    void dfs(int x,int y){
        if(mp[x][y]=='*'){
            ans++;return ;
        }
        vis[x][y]=tp;
        for(int i=0;i<4;i++){
            int nx=x+disx[i],ny=y+disy[i];
            if(nx<0||ny<0||nx>=n||ny>=m)continue;
            if(vis[nx][ny])continue;
            dfs(nx,ny);
        }
    }
    int main(){
        while(~scanf("%d%d%d",&n,&m,&k)){
            mem(mp,0);
            for(int i=0;i<n;i++)scanf("%s",mp[i]);
            int x,y;
            mem(dp,0);
            tp=1;
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(!vis[i][j]&&mp[i][j]=='.'){
                        ans=0;
                        dfs(i,j);
                        dp[tp]=ans;
                        tp++;
                    }
                }
            }
            while(k--){
                scanf("%d%d",&x,&y);
                //printf("%d
    ",mark[x-1][y-1]);
                printf("%d
    ",dp[vis[x-1][y-1]]);
            }
        }
        return 0;
    }

    我的wa代码:
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    const int INF=0x3f3f3f3f;
    #define mem(x,y) memset(x,y,sizeof(x))
    #define SI(x) scanf("%d",&x)
    #define PI(x) printf("%d",x)
    #define P_ printf(" ")
    int n,m,k;
    const int MAXN=2010;
    char mp[MAXN][MAXN];
    int vis[MAXN][MAXN];
    int mark[MAXN][MAXN];
    int ans;
    int disx[4]={0,0,1,-1};
    int disy[4]={1,-1,0,0};
    int dp[MAXN*MAXN];
    int a[MAXN],b[MAXN];
    int tp;
    int kk;
    void dfs(int x,int y){
        if(mp[x][y]=='*'){
            ans++;return ;
        }
        vis[x][y]=1;
        a[kk]=x;b[kk]=y;
        kk++;
        for(int i=0;i<4;i++){
            int nx=x+disx[i],ny=y+disy[i];
            if(nx<0||ny<0||nx>=n||ny>=m)continue;
            if(vis[nx][ny])continue;
            dfs(nx,ny);
        }
    }
    int main(){
        while(~scanf("%d%d%d",&n,&m,&k)){
            mem(mp,0);
            for(int i=0;i<n;i++)scanf("%s",mp[i]);
            int x,y;
            mem(dp,0);
            mem(mark,0);
            int tp=1;
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(!vis[i][j]&&mp[i][j]=='.'){
                        ans=0;
                        kk=0;
                        dfs(i,j);
                        for(int c=0;c<kk;c++){
                            mark[a[c]][b[c]]=tp;
                            dp[tp]=ans;
                            tp++;
                        }
                    }
                }
            }
            while(k--){
                scanf("%d%d",&x,&y);
                //printf("%d
    ",mark[x-1][y-1]);
                printf("%d
    ",dp[mark[x-1][y-1]]);
            }
        }
        return 0;
    }
  • 相关阅读:
    python数字图像处理(13):基本形态学滤波
    python数字图像处理(12):基本图形的绘制
    python数字图像处理(11):图像自动阈值分割
    python数字图像处理(10):图像简单滤波
    python数字图像处理(9):直方图与均衡化
    python数字图像处理(8):对比度与亮度调整
    python数字图像处理(7):图像的形变与缩放
    android --- api json数据
    android -------- Hawk数据库
    android -------- 沉浸式状态栏和沉浸式导航栏(ImmersionBar)
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5247521.html
Copyright © 2011-2022 走看看