1091. Acute Stroke (30)-PAT甲级真题 (三维数组BFS)

题意

给一个三维数组，数组深l长n高m。求出所有连通的1的块，这些块中1的数量表示块的大小，达到某个阈值t的记入数值count，最后输出总count大小。

思路

• 获取m、n、l、t
• 循环构图bool g[63][130][1300]
• 按照DFStraverse的方式进行BFStraverse，建立st[63][130][1300];记录是否被访问过。
• 每次BFS入队时cnt++，出队时cnt与阈值t比较，视情况加到ans中。最后输出ans。

总结

• 类似于acwing中的滑雪问题。BFS比起DFS具有更好的逻辑，并且避免了层数过深导致的栈溢出。
• 六个方向可以通过如下方式遍历。

int dx[6] = {-1, 0, 0, 1, 0, 0}, dy[6] = {0, -1, 0, 0, 1, 0}, dz[6] = {0, 0, -1, 0, 0, 1};

• 注意是每次入队时设置st为访问过，而非BFS访问和出队，类比spfa，要和堆优化dijkstra区分开。

题解

#include<bits/stdc++.h>
using namespace std;
bool g[61][1300][130], st[61][1300][130];
int n, m, l, t, cnt, ans;
struct node{
	int x, y, z;
	node(int a, int b, int c): x(a), y(b), z(c){};
};
int dx[6] = {-1, 0, 0, 1, 0, 0}, dy[6] = {0, -1, 0, 0, 1, 0}, dz[6] = {0, 0, -1, 0, 0, 1};
int BFS(int x, int y, int z){
	queue<node> que;
	cnt = 0;
	que.push(node(x, y, z));
	st[x][y][z] = true;
	while(que.size()){
		auto tar = que.front();
		que.pop();
		cnt++;
		for(int i = 0; i < 6; i ++){
			x = tar.x + dx[i], y = tar.y + dy[i], z = tar.z + dz[i];
			if(x >= 0 && x < l && y >= 0 && y < m && z >= 0 && z < n && !st[x][y][z] && g[x][y][z]){
				st[x][y][z] = true;
				que.push(node(x, y, z));
			}
		}
	}
	return cnt >= t ? cnt : 0;
}
int main(){
	cin>>m>>n>>l>>t;
	for(int i = 0; i < l; i ++)
		for(int j = 0; j < m; j ++)
			for(int k = 0; k < n; k ++)
				scanf("%d", &g[i][j][k]);
	for(int i = 0; i < l; i ++)
		for(int j = 0; j < m; j ++)
			for(int k = 0; k < n; k ++)
				if(!st[i][j][k] && g[i][j][k]) ans += BFS(i, j, k);
	cout<<ans;
	return 0;
}

题目

One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions are identified in each MRI slice, your job is to calculate the volume of the stroke core.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 positive integers: M, N, L and T, where M and N are the sizes of each slice (i.e. pixels of a slice are in an M×N matrix, and the maximum resolution is 1286 by 128); L (≤60) is the number of slices of a brain; and T is the integer threshold (i.e. if the volume of a connected core is less than T, then that core must not be counted).

Then L slices are given. Each slice is represented by an M×N matrix of 0’s and 1’s, where 1 represents a pixel of stroke, and 0 means normal. Since the thickness of a slice is a constant, we only have to count the number of 1’s to obtain the volume. However, there might be several separated core regions in a brain, and only those with their volumes no less than T are counted. Two pixels are connected and hence belong to the same region if they share a common side, as shown by Figure 1 where all the 6 red pixels are connected to the blue one.

Figure 1

Output Specification:

For each case, output in a line the total volume of the stroke core.

Sample Input:

3 4 5 2
1 1 1 1
1 1 1 1
1 1 1 1
0 0 1 1
0 0 1 1
0 0 1 1
1 0 1 1
0 1 0 0
0 0 0 0
1 0 1 1
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
1 0 0 0

Sample Output:

26