天梯题集——肿瘤诊断（三维bfs）

梦里梦外; 2022-12-24 11:57 102阅读 0赞

### 肿瘤诊断 ###

![题目][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1poZW5neWFuZ3hpbm4_size_16_color_FFFFFF_t_70]  
![t2][]

--------------------

看到题目第一眼，就害怕了。  
上网一查，原来只是个三维 bfs 。  
这是一道错过就会后悔的题…  
菜是原罪…  
[bfs模板题][bfs]

--------------------

#### 实现代码 ####

#include<bits/stdc++.h>
    using namespace std;
    int m, n, l, t, cnt;
    int zl[70][130][1300];
    bool judge[70][130][1300]={ false};
    
    int A[6] = { 0, 0, 0, 0, 1, -1};
    int B[6] = { 0, 0, 1, -1, 0, 0};
    int C[6] = { 1, -1, 0, 0, 0, 0};
    
    struct node{ 
    	int a, b, c;
    }Node, top;
    
    void bfs(int a, int b, int c){ 
    	Node = (node){ a, b, c};
    	queue <node> q;
    	q.push(Node);
    	while(!q.empty()){ 
    		top = q.front();
    		q.pop();
    		cnt++;
    		for(int i=0; i<6; i++){ 
    			int da = top.a+A[i];
    			int db = top.b+B[i];
    			int dc = top.c+C[i];
    			if(da<=l&&da>0&&db<=m&&db>0&&dc<=n&&dc>0&&
    				!judge[da][db][dc]&&zl[da][db][dc]){ 
    				judge[da][db][dc] = true;
    				Node = (node){ da, db, dc};
    				q.push(Node);
    			}
    		}
    	}
    	return;
    }
    
    int main(){ 
    	cin>>m>>n>>l>>t;
    	memset(zl, 0, sizeof(zl));
    	for(int i=1; i<=l; i++)
    	for(int j=1; j<=m; j++)
    	for(int k=1; k<=n; k++)
    		cin>>zl[i][j][k];
    	int sum=0;
    	
    	for(int i=1; i<=l; i++)
    	for(int j=1; j<=m; j++)
    	for(int k=1; k<=n; k++){ 
    		if(zl[i][j][k]&&!judge[i][j][k]){ 
    			cnt = 0;
    			judge[i][j][k]=true;
    			bfs(i, j, k);
    			if(cnt>=t) sum += cnt;
    		}
    	}
    	
    	cout<<sum<<endl;
    	return 0;
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1poZW5neWFuZ3hpbm4_size_16_color_FFFFFF_t_70]: /images/20221120/14ac1ff9562e4be980d1971393f7ae71.png
[t2]: /images/20221120/0d1508df3a14499486abef50833eba84.png
[bfs]: https://blog.csdn.net/Zhengyangxinn/article/details/104741556?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522160652875219724848151973%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=160652875219724848151973&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_v1~rank_blog_v1-1-104741556.pc_v1_rank_blog_v1&utm_term=BFS&spm=1018.2118.3001.4450