标签：Node Acute slice 1091 core int ++ Stroke pixel

1091 Acute Stroke

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.

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

#include<cstdio>
#include<queue>
using namespace std;

struct node
{
  int x;
  int y;
  int z;
}Node;

int X[6] = { 0,0,0,0,-1,1 };
int Y[6] = { 0,0,-1,1,0,0 };
int Z[6] = { -1,1,0,0,0,0 };

int pixel[1280][128][128];
bool inqu[1280][128][128];

int n, m, slice, T;

bool test(int x, int y, int z)
{
  if (x < 0 || x >= n || y < 0 || y >= m || z < 0 || z >= slice)
  {
    return false;
  }
  else if(pixel[x][y][z]==0||inqu[x][y][z]==true)
  {
    return false;
  }
  else
  {
    return true;
  }
}

int BFS(int x, int y, int z)
{
  int tot = 0;
  queue<node> Q;
  Node.x = x, Node.y = y, Node.z = z;
  Q.push(Node);
  inqu[x][y][z] = true;
  while (!Q.empty())
  {
    node top = Q.front();
    Q.pop();
    tot++;
    for (int i = 0; i < 6; i++)
    {
      int newX = top.x + X[i];
      int newY = top.y + Y[i];
      int newZ = top.z + Z[i];
      if (test(newX, newY, newZ))
      {
        Node.x = newX, Node.y = newY, Node.z = newZ;
        Q.push(Node);
        inqu[newX][newY][newZ] = true;
      }
    }
  }
  if (tot >= T)
    return tot;
  else
    return 0;
}

int main()
{
  scanf_s("%d%d%d%d", &n, &m, &slice, &T);
  for (int z = 0; z < slice; z++)
  {
    for (int x = 0; x < n; x++)
    {
      for (int y = 0; y < m; y++)
      {
        scanf_s("%d", &pixel[x][y][z]);
      }
    }
  }
  int ans = 0;
  for (int z = 0; z < slice; z++)
  {
    for (int x = 0; x < n; x++)
    {
      for (int y = 0; y < m; y++)
      {
        if (pixel[x][y][z] == 1 && inqu[x][y][z] == false)
          ans += BFS(x, y, z);
      }
    }
  }
  printf("%d\n", ans);
}

标签：Node,Acute,slice,1091,core,int,++,Stroke,pixel
来源： https://blog.csdn.net/weixin_44230791/article/details/123204289

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。