PAT 甲级 1091. Acute Stroke (30)
来源:互联网 发布:logitech g502 mac 编辑:程序博客网 时间:2024/06/05 20:59
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 by 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 by 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 21 1 1 11 1 1 11 1 1 10 0 1 10 0 1 10 0 1 11 0 1 10 1 0 00 0 0 01 0 1 10 0 0 00 0 0 00 0 0 10 0 0 11 0 0 0Sample Output:
26
#include <algorithm>#include <queue>#include <cstring>#include <iostream>#include <vector>#include <string>using namespace std;struct node {int x, y, z;};int m, n, l, t;int X[6] = { 1, 0, 0, -1, 0, 0 };int Y[6] = { 0, 1, 0, 0, -1, 0 };int Z[6] = { 0, 0, 1, 0, 0, -1 };int arr[1300][130][80];bool visit[1300][130][80];bool judge(int x, int y, int z) {if (x < 0 || x >= m || y < 0 || y >= n || z < 0 || z >= l) return false;if (arr[x][y][z] == 0 || visit[x][y][z] == true) return false;return true;}int bfs(int x, int y, int z) {int cnt = 0;node temp;temp.x = x, temp.y = y, temp.z = z;queue<node> q;q.push(temp);visit[x][y][z] = true;while (!q.empty()) {node top = q.front();q.pop();cnt++;for (int i = 0; i < 6; i++) {int tx = top.x + X[i];int ty = top.y + Y[i];int tz = top.z + Z[i];if (judge(tx, ty, tz)) {visit[tx][ty][tz] = true;temp.x = tx, temp.y = ty, temp.z = tz;q.push(temp);}}}if (cnt >= t)return cnt;elsereturn 0;}int main() {scanf("%d %d %d %d", &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", &arr[j][k][i]);int ans = 0;for (int i = 0; i < l; i++) {for (int j = 0; j < m; j++) {for (int k = 0; k < n; k++) {if (arr[j][k][i] == 1 && visit[j][k][i] == false)ans += bfs(j, k, i);}}}printf("%d\n", ans);return 0;}
- 1091. Acute Stroke (30) PAT甲级
- PAT 甲级 1091. Acute Stroke (30)
- [转]PAT甲级练习1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- 【PAT】1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- PAT 1091. Acute Stroke
- 【PAT】1091. Acute Stroke
- PAT Acute Stroke (30)
- pat- Acute Stroke (30)
- 1091. Acute Stroke (30)-PAT甲级真题(广度优先搜索)
- PAT A 1091. Acute Stroke (30)
- PAT(Advance) 1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)(孤岛问题)
- PAT(A) - 1091. Acute Stroke (30)
- PAT--1091. Acute Stroke (30)(三维bfs)
- PAT-A-1091. Acute Stroke (30)
- 《JAVA多线程编程的艺术》-volatile重排序规则理解
- java BufferedReader和PrintWriter
- Codeforces Round #438 B Race Against Time(模拟)
- window系统安装杂笔
- 前端之路随笔小记——属性:lang VS charset
- PAT 甲级 1091. Acute Stroke (30)
- 一点 · 线性表
- PAT 甲级 1093. Count PAT's (25)
- 前端的window.location
- java实现linux中gzip压缩解压缩算法:byte[]字节数组,文件,字符串,数据流的压缩解压缩
- linux内核驱动模块开发步骤及实例入门介绍
- 51 nod 苹果曼和树
- QT自定义控件之圆形头像的实现
- Codeforces Round #438 C Qualification Rounds(暴力+位运算)