SPOJ.rar_SPOJ

#include <iostream> #include <vector> #include <algorithm> #include <queue> #define MAXN 110 #define FOR(i,a,b) for(int i=a ; i<=b ; i++) #define FORD(i,a,b) for(int i=a ; i>=b ; i--) using namespace std; int r, c, result; char a[MAXN][MAXN]; bool freex[MAXN][MAXN]; int main() { int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; scanf("%d%d", &r, &c); FOR(i,1,r) FOR(j,1,c) freex[i][j] = false; FOR(i,1,r) { FOR(j,1,c) { char c; cin>> c; if(c=='#') freex[i][j] = true; } } queue< pair<int, int> > q; FOR(i,1,r) { FOR(j,1,c) { if(freex[i][j]) { result++; freex[i][j] = false; q.push(make_pair(i,j)); while(!q.empty()) { pair<int, int> p = q.front(); q.pop(); FOR(k,0,3) { int u = p.first + dx[k]; int v = p.second + dy[k]; if(freex[u][v]) { freex[u][v] = false; q.push(make_pair(u,v)); } } } } } } cout<< result <<endl; //system("pause"); }