【PAT 1004 Acute Stroke (30)】& dfs
来源:互联网 发布:js实现点击重置按钮 编辑:程序博客网 时间:2024/06/05 09:51
题目描述
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.
输入描述:
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
输出描述:
For each case, output in a line the total volume of the stroke core.
输入例子:
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
输出例子:
26
题意 : 给出 L 层 M * N 的矩阵,求矩阵里相邻的 1 的面积,不大于 T 的面积被忽略不计
思路 : dfs 一遍遍历
AC代码:
#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;const int MAX = 1e5 + 10;typedef long long LL;int vis[62][1290][130],a[62][1290][130],sum,ans;int fx[4] = {-1,1,0,0},fy[4] = {0,0,-1,1},T,N,M,L;void dfs(int z,int x,int y){ if(vis[z][x][y] || !a[z][x][y]) return ; vis[z][x][y] = 1,sum++; for(int i = 0; i < 4; i++){ int xx = x + fx[i],yy = y + fy[i]; if(xx >= 1 && yy >= 1 && xx <= N && yy <= M) dfs(z,xx,yy); } if(z > 1) dfs(z - 1,x,y); if(z < L) dfs(z + 1,x,y);}int main(){ scanf("%d %d %d %d",&N,&M,&L,&T); for(int i = 1; i <= L; i++) for(int j = 1; j <= N; j++) for(int k = 1; k <= M; k++) scanf("%d",&a[i][j][k]); ans = 0; for(int i = 1; i <= L; i++) for(int j = 1; j <= N; j++) for(int k = 1; k <= M; k++) if(!vis[i][j][k]){ sum = 0,dfs(i,j,k); if(sum >= T) ans += sum; } printf("%d\n",ans); return 0;}
- 【PAT 1004 Acute Stroke (30)】& dfs
- PAT Acute Stroke (30)
- pat- Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- 【PAT】1091. Acute Stroke (30)
- 【PAT】A1091. Acute Stroke (30)
- PAT 1091. Acute Stroke (30)
- PAT A1091. Acute Stroke (30)
- pat-a1091. Acute Stroke (30)
- 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)
- 1091. Acute Stroke (30) PAT甲级
- PAT-A-1091. Acute Stroke (30)
- Pat(A) 1091. Acute Stroke (30)
- qt5文件读写的简单用法
- Android高效加载大图、多图解决方案,有效避免程序OOM
- Spring之IOC、AOP的理解
- JQ实现轮播
- docker centos redis 基础常用命令
- 【PAT 1004 Acute Stroke (30)】& dfs
- 【PAT】【Advanced Level】1095. Cars on Campus (30)
- BeautifulSoup库中find_all()方法
- 2017最新java学习大全
- Silver Cow Party
- Retrofit和Rxjava的简单了解
- tf-idf:sklearn中TfidfVectorizer使用
- spring-task
- 【Java】split(".")