省赛一Ballons dfs

最新推荐文章于 2020-08-02 21:35:08 发布

fxy流年无悔

最新推荐文章于 2020-08-02 21:35:08 发布

阅读量373

点赞数

分类专栏： dfs 文章标签： dfs

本文链接：https://blog.csdn.net/a716121/article/details/51039386

版权

dfs 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Balloons

Time Limit: 1000MS Memory limit: 65536K

题目描述

Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly balloons to pattern a big image.
They were very interested about this event, and also curious about the image.
Since there are too many balloons, it is very hard for them to compute anything they need. Can you help them?
You can assume that the image is an N*N matrix, while each element can be either balloons or blank.
Suppose element A and element B are both balloons. They are connected if:
i) They are adjacent;
ii) There is a list of element C₁, C₂, … , C_n, while A and C₁ are connected, C₁ and C₂ are connected …C_n and B are connected.
And a connected block means that every pair of elements in the block is connected, while any element in the block is not connected with any element out of the block.
To Saya, element A(xa,ya)and B(xb,yb) is adjacent if |xa-xb| + |ya-yb| ≤ 1
But to Kudo, element A(xa,ya) and element B (xb,yb) is adjacent if |xa-xb|≤1 and |ya-yb|≤1
They want to know that there’s how many connected blocks with there own definition of adjacent?

输入

The input consists of several test cases.
The first line of input in each test case contains one integer N (0<N≤100), which represents the size of the matrix.
Each of the next N lines contains a string whose length is N, represents the elements of the matrix. The string only consists of 0 and 1, while 0 represents a block and 1represents balloons.
The last case is followed by a line containing one zero.

输出

For each case, print the case number (1, 2 …) and the connected block’s numbers with Saya and Kudo’s definition. Your output format should imitate the sample output. Print a blank line after each test case.

示例输入

示例输出

Case 1: 3 2

#include <iostream>
#include<string.h>
#include<cstdio>
using namespace std;
char map[101][101];
int vis[101][101];
int n;
void dfs1(int x,int y)///仅仅4个方向
{
    if(map[x][y]=='0'||x<0||x>=n||y<0||y>=n||vis[x][y])
        return;
    vis[x][y]=1;
    dfs1(x+1,y);
    dfs1(x-1,y);
    dfs1(x,y+1);
    dfs1(x,y-1);
}
void dfs2(int x,int y)
{
    if(map[x][y]=='0'||x<0||y<0||x>=n||y>=n||vis[x][y])
        return;
    vis[x][y]=1;
    dfs2(x+1,y);
    dfs2(x,y+1);
    dfs2(x-1,y);
    dfs2(x,y-1);
    dfs2(x+1,y+1);
    dfs2(x-1,y-1);
    dfs2(x+1,y-1);
    dfs2(x-1,y+1);
}
int main()
{
    while(scanf("%d",&n)&&n)
    {
        int j=0;
        int sum1=0;
        int sum2=0;
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
            scanf("%s",map[i]);
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                if(!vis[i][j]&&map[i][j]=='1')///vis[x][y]==0&&map[x][y]=='1'
                {
                    dfs1(i,j);
                    sum1++;
                }
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                if(!vis[i][j]&&map[i][j]=='1')
                {
                    dfs2(i,j);
                    sum2++;
                }
        printf("Case %d: %d %d\n\n",++j,sum1,sum2);
    }
    return 0;
}

总结：做了这一个题，类似的深搜都理解了

此题关键理解：

To Saya, element A(xa,ya)and B(xb,yb) is adjacent if |xa-xb| + |ya-yb| ≤ 1 ///4个方向
But to Kudo, element A(xa,ya) and element B (xb,yb) is adjacent if |xa-xb|≤1 and |ya-yb|≤1///8个方向