【PAT】【Advanced Level】1091. Acute Stroke (30)
2017-09-04 16:59
603 查看
1091. Acute Stroke (30)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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.
![](http://nos.patest.cn/g0_nf8qpnrr0f1.jpg)
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
原题链接:
https://www.patest.cn/contests/pat-a-practise/1091
https://www.nowcoder.com/pat/5/problem/4317
思路:
求联通块元素的个数
DFS:
PAT爆栈,牛客网可过。
BFS:
均AC
CODE:
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#define L 61
#define M 1287
#define N 129
using namespace std;
typedef struct S
{
int x;
int y;
int z;
};
bool fl[L][M]
;
bool f[L][M]
;
vector<S> zb;
queue<S> qu;
int l,m,n,t;
int dfs(S a)
{
int sum=1;
int x=a.x;
int y=a.y;
int z=a.z;
if (x>0)
{
if (fl[z][y][x-1]==1)
if (f[z][y][x-1]==0)
{
f[z][y][x-1]=1;
S t;
t.z=z;
t.y=y;
t.x=x-1;
sum+=dfs(t);
}
}
if (x<n)
{
if (fl[z][y][x+1]==1)
if (f[z][y][x+1]==0)
{
f[z][y][x+1]=1;
S t;
t.z=z;
t.y=y;
t.x=x+1;
sum+=dfs(t);
}
}
if (y>0)
{
if (fl[z][y-1][x]==1)
if (f[z][y-1][x]==0)
{
f[z][y-1][x]=1;
S t;
t.z=z;
t.y=y-1;
t.x=x;
sum+=dfs(t);
}
}
if (y<m)
{
if (fl[z][y+1][x]==1)
if (f[z][y+1][x]==0)
{
f[z][y+1][x]=1;
S t;
t.z=z;
t.y=y+1;
t.x=x;
sum+=dfs(t);
}
}
if (z>0)
{
if (fl[z-1][y][x]==1)
if (f[z-1][y][x]==0)
{
f[z-1][y][x]=1;
S t;
t.z=z-1;
t.y=y;
t.x=x;
sum+=dfs(t);
}
}
if (z<l)
{
if (fl[z+1][y][x]==1)
if (f[z+1][y][x]==0)
{
f[z+1][y][x]=1;
S t;
t.z=z+1;
t.y=y;
t.x=x;
sum+=dfs(t);
}
}
return sum;
}
int bfs(S a)
{
int sum=1;
qu.push(a);
while (!qu.empty())
{
int x=qu.front().x;
int y=qu.front().y;
int z=qu.front().z;
qu.pop();
if (x>0)
{
if (fl[z][y][x-1]==1)
if (f[z][y][x-1]==0)
{
f[z][y][x-1]=1;
S t;
t.z=z;
t.y=y;
t.x=x-1;
sum++;
qu.push(t);
}
}
if (x<n)
{
if (fl[z][y][x+1]==1)
if (f[z][y][x+1]==0)
{
f[z][y][x+1]=1;
S t;
t.z=z;
t.y=y;
t.x=x+1;
sum++;
qu.push(t);
}
}
if (y>0)
{
if (fl[z][y-1][x]==1)
if (f[z][y-1][x]==0)
{
f[z][y-1][x]=1;
S t;
t.z=z;
t.y=y-1;
t.x=x;
sum++;
qu.push(t);
}
}
if (y<m)
{
if (fl[z][y+1][x]==1)
if (f[z][y+1][x]==0)
{
f[z][y+1][x]=1;
S t;
t.z=z;
t.y=y+1;
t.x=x;
sum++;
qu.push(t);
}
}
if (z>0)
{
if (fl[z-1][y][x]==1)
if (f[z-1][y][x]==0)
{
f[z-1][y][x]=1;
S t;
t.z=z-1;
t.y=y;
t.x=x;
sum++;
qu.push(t);
}
}
if (z<l)
{
if (fl[z+1][y][x]==1)
if (f[z+1][y][x]==0)
{
f[z+1][y][x]=1;
S t;
t.z=z+1;
t.y=y;
t.x=x;
sum++;
qu.push(t);
}
}
}
return sum;
}
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",&fl[i][j][k]);
if (fl[i][j][k]==1)
{
S t;
t.x=k;
t.y=j;
t.z=i;
zb.push_back(t);
f[i][j][k]=0;
}
}
int res=0;
for (int i=0;i<zb.size();i++)
{
int sum;
if (f[zb[i].z][zb[i].y][zb[i].x]==0)
{
//cout<<zb[i].z<<" "<<zb[i].y<<" "<<zb[i].x<<endl;
f[zb[i].z][zb[i].y][zb[i].x]=1;
//sum=dfs(zb[i]);
sum=bfs(zb[i]);
//cout<<sum<<endl;
if (sum>=t)
res+=sum;
}
}
cout<<res;
return 0;
}
相关文章推荐
- PAT (Advanced Level) 1091. Acute Stroke (30) 3维DFS(10M数据时栈溢出)、3维BFS(AC)
- 1091. Acute Stroke (30)【搜索】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1091 Acute Stroke (30)
- PAT (Advanced Level) 1091. Acute Stroke (30)
- PAT (Advanced Level) Practise 1091 Acute Stroke (30)
- Pat(Advanced Level)Practice--1091(Acute Stroke)
- 【PAT】【Advanced Level】1119. Pre- and Post-order Traversals (30)
- 【PAT】【Advanced Level】1131. Subway Map (30)
- PAT (Advanced Level)1135. Is It A Red-Black Tree (30) 指针 建树 深度优先遍历
- PAT (Advanced Level) Practise - 1095. Cars on Campus (30)
- PAT (Advanced Level) Practise 1115 Counting Nodes in a BST (30)
- 1014. Waiting in Line (30)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1049 Counting Ones (30)
- PAT (Advanced Level) Practise 1045 Favorite Color Stripe (30)
- PAT (Advanced Level) 1018. Public Bike Management (30) 杭州自行车 最短路径+DFS
- PAT (Advanced Level) 1057. Stack (30) 模拟栈,O(1)输出栈的中位数,用set辅助
- 【PAT】【Advanced Level】1049. Counting Ones (30)
- PAT (Advanced Level) 1087. All Roads Lead to Rome (30)
- 【PAT】【Advanced Level】1064. Complete Binary Search Tree (30)
- 【PAT】【Advanced Level】1072. Gas Station (30)