OJ刷题记录：L1-108-神奇的水管(20分)

5
--+--
-+-+-
-+--+
-----
----+

3

#include <iostream>
#include <vector>
#include <queue>

using namespace std;	

void checkPipe(vector<vector<char>> &matrix, int originX, int originY) {
	const int bx[] = {0, 0, -1, 1, -1, 1};
	const int by[] = {1, -1, 0, 0, -1, 1};
	int ROW = matrix.size();
	int COLUMN = matrix[0].size();
	
	matrix[originX][originY] = '-';
	
	queue<pair<int, int>> q;
	q.emplace(pair<int, int>(originX, originY));
	
	while (!q.empty()) {
		int x = q.front().first;
		int y = q.front().second;
		q.pop();
		
		for (int i = 0; i < 6; i++) {
			int nx = x + bx[i];
			int ny = y + by[i];
			
			if (nx >= 0 && nx < ROW && ny >= 0 && ny < COLUMN) {
				if (matrix[nx][ny] == '+') {
					matrix[nx][ny] = '-';
					q.emplace(pair<int, int>(nx, ny));
				}
			}
		}
	} 
}

int main() {
	int n, sum = 0;
	
	cin >> n;
	
	vector<char> arr(n);
	vector<vector<char>> matrix;
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> arr[j];
		}
		matrix.emplace_back(arr);
	}
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (matrix[i][j] == '+') {
				sum++;
				checkPipe(matrix, i, j);
			}
		}
	}
	
	cout << sum;
	
	return 0;
}