G. Sheba's Amoebas -ICPC North Central NA Contest 2017

https://nanti.jisuanke.com/t/43374

G. Sheba's Amoebas -ICPC North Central NA Contest 2017_第1张图片

G. Sheba's Amoebas -ICPC North Central NA Contest 2017_第2张图片

G. Sheba's Amoebas -ICPC North Central NA Contest 2017_第3张图片

题意

  判断像素矩阵中像素围成的封闭区域的个数

思路

  对于每一个像素,检查周围是否有像素形成相连

  从当前下一个未标记的像素开始进行搜索,搜索结果作为下一个节点进行搜索,在搜索的同时进行染色

  遇到已经染色的像素,判断为一个封闭空间

代码

  

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define gc getchar()
#define mem(a) memset(a,0,sizeof(a))
//#define sort(a,n,int) sort(a,a+n,less())

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair pii;
typedef char ch;
typedef double db;

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;


bool compare(int a, int b)
{
	return a < b;//升序
}

int filed[102][102] = {0};
bool Fill_Color(int x , int y)
{
	bool flag = 0;
	if(filed[x+1][y] == 1){
		filed[x+1][y] = 2;
		Fill_Color(x+1 , y);
		flag = 1;
	}
	if(filed[x-1][y] == 1){
		filed[x-1][y] = 2;
		Fill_Color(x-1 , y);
		flag = 1;
	}
	if(filed[x][y+1] == 1){
		filed[x][y+1] = 2;
		Fill_Color(x , y+1);
		flag = 1;
	}
	if(filed[x][y-1] == 1){
		filed[x][y-1] = 2;
		Fill_Color(x , y-1);
		flag = 1;
	}
	if(filed[x+1][y+1] == 1){
		filed[x+1][y+1] = 2;
		Fill_Color(x+1 , y+1);
		flag = 1;
	}
	if(filed[x-1][y-1] == 1){
		filed[x-1][y-1] = 2;
		Fill_Color(x-1 , y-1);
		flag = 1;
	}
	if(filed[x+1][y-1] == 1){
		filed[x+1][y-1] = 2;
		Fill_Color(x+1 , y-1);
		flag = 1;
	}
	if(filed[x-1][y+1] == 1){
		filed[x-1][y+1] = 2;
		Fill_Color(x-1 , y+1);
		flag = 1;
	}
	return flag;
}
char pool[100] = {0};
int main()
{
	int a , b;
	cin >>a >>b;
	int counter = 0;
	for(int i = 1;i<=a;i++)
	{
		cin >>pool;
		for(int j = 0;j<=b;j++)
		{
			if(pool[j] == '#')
			{
				filed[i][j] = 1;
			}
		}
	}
	for(int i = 1;i<=a;i++)
	{
		for(int j = 0;j<=b;j++)
		{
			if(filed[i][j] == 1)
			{
				Fill_Color(i , j);
				counter++;
			}
		}
	}
	cout<

  

你可能感兴趣的:(G. Sheba's Amoebas -ICPC North Central NA Contest 2017)