UESTC 1855 C.S.I.: P15

來源:互聯網
上載者:User

     是個遞迴,dfs的題目,主要是判斷是鳥的時候要判斷其周圍的點是'.'空氣,一共判斷18個點。

        #include<cstring>#include<cstdio>using namespace std;char map[35][35];int h,w,vis[35][35];void dfs(int x,int y){     if(!(map[x][y]=='|'||map[x][y]=='/'||map[x][y]=='\\'||map[x][y]=='-'||map[x][y]=='@')||vis[x][y])     return ;       vis[x][y]=1;        dfs(x+1,y);        dfs(x-1,y);        dfs(x,y+1);        dfs(x,y-1);        dfs(x+1,y+1);        dfs(x+1,y-1);        dfs(x-1,y+1);        dfs(x-1,y-1);}int main(){    //freopen("in.txt","r",stdin);    int i,j,cas,flower,bird;    scanf("%d",&cas);    while(cas--)    {        scanf("%d%d",&h,&w);        getchar();        memset(map,'.',sizeof(map));        for(i=1; i<=h; i++)        {            for(j=1; j<=w; j++)                scanf("%c",&map[i][j]);            getchar();        }        /*for(i=1;i<=h;i++)        {            for(j=1;j<=w;j++)            printf("%c",map[i][j]);            putchar('\n');        }*/        memset(vis,0,sizeof(vis));        flower=0;        bird=0;        for(i=1; i<=w; i++)        {            if(!vis[h-1][i]&&(map[h-1][i]=='|'||map[h-1][i]=='/'||map[h-1][i]=='\\'||map[h-1][i]=='-'||map[h-1][i]=='@'))            {                //printf("tt\n");                dfs(h-1,i);                flower++;            }        }        for(i=1; i<=h; i++)        {            for(j=1; j<=w; j++)            {                if(!vis[i][j]&&map[i][j]=='/'&&map[i][j+1]=='\\'&&map[i][j+2]=='/'&&map[i][j+3]=='\\')                {                    vis[i][j]=1;                    if(map[i-1][j-1]=='.'&&map[i-1][j]=='.'&&map[i-1][j+1]=='.'&&map[i-1][j+2]=='.'&&map[i-1][j+3]=='.'&&map[i-1][j+4]=='.')                    {                        if(map[i][j-1]=='.'&&map[i][j+4]=='.')                        {                            if(map[i+1][j-1]=='.'&&map[i+1][j]=='.'&&map[i+1][j+1]=='.'&&map[i+1][j+2]=='.'&&map[i+1][j+3]=='.'&&map[i+1][j+4]=='.')                                bird++;                        }                    }                }            }        }        printf("Flowers: %d\n",flower);        printf("Birds: %d\n",bird);    }    return 0;}     

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.