PAT1091. Acute Stroke (30)
来源:互联网 发布:交换机的端口带宽 编辑:程序博客网 时间:2024/05/21 10:26
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
解题思路:用的是并查集,有点麻烦。
注意点:要将小的集合接到大的集合上,否则最后一个测点会超时。
AC代码:
#include<iostream>using namespace std;int m,n,l,t;int ufs[85*1286*128];bool slice[65][1300][135];int gethead(int a){ if(ufs[a] == a) return a; while(ufs[a] > 0) a = ufs[a]; return a;}void unite(int a, int b){ int ha = gethead(a); int hb = gethead(b); if(ha == hb) return; else if(ufs[a] == a&&ufs[b] == b) { ufs[a] = -2; ufs[b] = a; } else if(ufs[ha] < 0&&ufs[hb] < 0) { if(ufs[ha] < ufs[hb]) { ufs[ha] += ufs[hb]; ufs[hb] = ha; } else { ufs[hb] += ufs[ha]; ufs[ha] = hb; } } else if(ufs[ha] < 0) { ufs[ha]--; ufs[hb] = ha; } else if(ufs[hb] < 0) { ufs[hb]--; ufs[ha] = hb; }}int main(){ scanf("%d%d%d%d",&m,&n,&l,&t); for(int i = 1; i <= l; i++) { for(int j = 1; j <= m; j++) { for(int k = 1; k <= n; k++) { int temp; scanf("%d",&temp); slice[i][j][k] = temp; } } } int num = l * m * n; for(int i = 1; i <= num; i++) ufs[i] = i; for(int i = 1; i <= l; i++) { for(int j = 1; j <= m; j++) { for(int k = 1; k <= n; k++) { int temp = (i - 1) * m * n + (j - 1) * n + k; if(slice[i][j][k]==0) continue; if(temp + m * n <= num&&slice[i + 1][j][k] != 0) unite(temp,temp + m * n); if(temp + n <= num&&slice[i][j + 1][k] != 0) unite(temp,temp + n); if(temp + 1 <= num&&slice[i][j][k + 1] != 0) unite(temp,temp + 1); if(ufs[temp] == temp) ufs[temp] = -1; } } } int sum = 0; for(int i = 1; i <= num; i++) { if(ufs[i] != i) { int tt = abs(ufs[gethead(i)]); if(tt >= t) { sum++; } } } cout<<sum; return 0;}
- PAT1091. Acute Stroke (30)
- pat1091 Acute Stroke
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- PAT1004-Acute Stroke (30)
- 1091. Acute Stroke(30)
- 1091. Acute Stroke (30)
- PAT Acute Stroke (30)
- 1091. Acute Stroke (30)
- 1091. Acute Stroke (30)
- HDU - 4578 -Transformation(线段树)
- 练习
- ecshop XSS跨站脚本漏洞,直接搞进后台 你们懂的!
- SpringBoot配置属性之NOSQL
- Git自学笔记
- PAT1091. Acute Stroke (30)
- 【转】NAT穿透的详细讲解及分析
- SpringBoot配置属性之MQ
- 周期串
- Activity 动态 强制 切换横竖屏 生命周期重载
- 最大子段和问题的四种算法(暴力法、优化后的暴力法、分治算法、动态规划算法)
- SpringBoot配置属性之Security
- 大学感悟【四】
- Bootstrap 导航元素