pat1091. Acute Stroke (30)

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.

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

---

提交代码

方法一：二维数组做法。注意DFS要段错误的。

 #include<cstdio>
 #include<cmath>
 #include<cstring>
 #include<stack>
 #include<algorithm>
 #include<iostream>
 #include<stack>
 #include<set>
 #include<map>
 #include<vector>
 #include<queue>
 using namespace std;
 int m,n,l,t;
 bool isin(int x,int y,int part)
 {
     if(x<||x/m!=part||y<||y>=n)
     {
         return false;
     }
     return true;
 }
 bool vis[*][],ma[*][];
 int dx[]= {-,,,},dy[]= {,,-,};
 /*void DFS(int x,int y,int &count){
     int part=x/m;//块的编号
     vis[x][y]=true;
     int i,xx,yy;
     for(i=0;i<4;i++){
         xx=x+dx[i];
         yy=y+dy[i];
         if(isin(xx,yy,part)&&ma[xx][yy]&&!vis[xx][yy]){
             DFS(xx,yy,++count);
         }
     }
     xx=x+dx[i];
     yy=y+dy[i];
     if(xx>=0&&ma[xx][yy]&&!vis[xx][yy]){
         DFS(xx,yy,++count);
     }
     i++;
     xx=x+dx[i];
     yy=y+dy[i];
     if(xx<l&&ma[xx][yy]&&!vis[xx][yy]){
         DFS(xx,yy,++count);
     }
 }*/
 void BFS(int x,int y,int &count)
 {
     queue<pair<int,int> > q;
     vis[x][y]=true;
     pair<int,int> p;
     q.push(make_pair(x,y));
     int xx,yy,i;
     while(!q.empty())
     {
         p=q.front();
         q.pop();
         x=p.first;
         y=p.second;
         int part=x/m;
         for(i=; i<; i++)
         {
             xx=x+dx[i];
             yy=y+dy[i];
             if(isin(xx,yy,part)&&ma[xx][yy]&&!vis[xx][yy])
             {
                 vis[xx][yy]=true;
                 count++;
                 q.push(make_pair(xx,yy));//DFS(xx,yy,++count);
             }
         }
         xx=x+dx[i];
         yy=y+dy[i];
         if(xx>=&&ma[xx][yy]&&!vis[xx][yy])
         {
             vis[xx][yy]=true;
             count++;
             q.push(make_pair(xx,yy));//DFS(xx,yy,++count);
         }
         i++;
         xx=x+dx[i];
         yy=y+dy[i];
         if(xx<l&&ma[xx][yy]&&!vis[xx][yy])
         {
             vis[xx][yy]=true;
             count++;
             q.push(make_pair(xx,yy));//DFS(xx,yy,++count);
         }
     }
 }
 int main()
 {
     //freopen("D:\\INPUT.txt","r",stdin);
     scanf("%d %d %d %d",&m,&n,&l,&t);
     l*=m;
     dx[]=-m;
     dy[]=;
     dx[]=m;
     dy[]=;
     int i,j,num;
     memset(vis,false,sizeof(vis));
     memset(ma,false,sizeof(ma));
     for(i=; i<l; i++)
     {
         for(j=; j<n; j++)
         {
             scanf("%d",&num);
             if(num)
             {
                 ma[i][j]=true;
             }
         }
     }
     int count,sum=;
     for(i=; i<l; i++)
     {
         for(j=; j<n; j++)
         {
             if(ma[i][j]&&!vis[i][j])
             {
                 count=;

                 BFS(i,j,count);
                 if(count>=t)
                 {
                     sum+=count;
                 }
             }
         }
     }
     printf("%d\n",sum);
     return ;
 }

方法二：三维数组。

 #include<cstdio>
 #include<cmath>
 #include<cstring>
 #include<stack>
 #include<algorithm>
 #include<iostream>
 #include<stack>
 #include<set>
 #include<map>
 #include<vector>
 #include<queue>
 using namespace std;
 int m,n,l,t;
 bool isin(int x,int y,int z)
 {
     if(x<||x>=m||y<||y>=n||z<||z>=l)
     {
         return false;
     }
     return true;
 }
 struct node{
     int x,y,z;
     node(){}
     node(int _x,int _y,int _z):x(_x),y(_y),z(_z){}
 };
 bool vis[][][],ma[][][];
 int dx[]= {-,,,,,},dy[]= {,,-,,,},dz[]= {,,,,-,};
 void BFS(int x,int y,int z,int &count)
 {
     queue<node> q;
     vis[z][x][y]=true;
     q.push(node(x,y,z));
     int xx,yy,zz,i;
     node p;
     while(!q.empty())
     {
         p=q.front();
         q.pop();
         x=p.x;
         y=p.y;
         z=p.z;
         for(i=; i<; i++)
         {
             xx=x+dx[i];
             yy=y+dy[i];
             zz=z+dz[i];
             if(isin(xx,yy,zz)&&ma[zz][xx][yy]&&!vis[zz][xx][yy])
             {
                 vis[zz][xx][yy]=true;
                 count++;
                 q.push(node(xx,yy,zz));//DFS(xx,yy,++count);
             }
         }
     }
 }
 int main()
 {
     //freopen("D:\\INPUT.txt","r",stdin);
     scanf("%d %d %d %d",&m,&n,&l,&t);
     int i,j,k,num;
     memset(vis,false,sizeof(vis));
     memset(ma,false,sizeof(ma));
     for(k=; k<l; k++)
     {
         for(i=; i<m; i++)
         {
             for(j=; j<n; j++)
             {
                 scanf("%d",&num);
                 if(num)
                 {
                     ma[k][i][j]=true;
                 }
             }
         }
     }

     int count,sum=;
     for(k=; k<l; k++)
     {
         for(i=; i<m; i++)
         {
             for(j=; j<n; j++)
             {
                 if(ma[k][i][j]&&!vis[k][i][j])
                 {
                     count=;
                     BFS(i,j,k,count);
                     if(count>=t)
                     {
                         sum+=count;
                     }
                 }
             }
         }
     }
     printf("%d\n",sum);
     return ;
 }