第十四届蓝桥杯三月真题刷题训练——第 25 天

最新推荐文章于 2024-07-23 22:06:37 发布

⠀One0ne

最新推荐文章于 2024-07-23 22:06:37 发布

阅读量187

点赞数

分类专栏：蓝桥杯真题文章标签：蓝桥杯深度优先算法

本文链接：https://blog.csdn.net/qq_53655497/article/details/129809528

版权

蓝桥杯真题专栏收录该内容

25 篇文章 1 订阅

订阅专栏

全球变暖

原题链接

全球变暖

问题描述

todo：这里复制题目描述

解题思路

BFS / DFS 都可以，个人习惯用 BFS

参考代码

import java.io.*;
import java.util.ArrayDeque;
import java.util.Deque;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
   
    static int N = 1010, n;
    static char[][] g = new char[N][N];
    static boolean[][] vis = new boolean[N][N];
    static int[] dx = {0, 1, 0, -1};
    static int[] dy = {1, 0, -1, 0};
      
    public static void main(String[] args) throws Exception {
    	n = Integer.parseInt(in.readLine());
    	
    	for (int i = 0; i < n; i++) {
    		String row = in.readLine();
    		for (int j = 0; j < n; j++) {
    			g[i][j] = row.charAt(j);
    		}
    	}
    	Deque<int[]> dq = new ArrayDeque<>();
    	int ans = 0;
    	for (int i = 0; i < n; i++) {
    		for (int j = 0; j < n; j++) {
    			if (g[i][j] == '#' && !vis[i][j]) {
    				ans++;
    				vis[i][j] = true;
    				dq.offerLast(new int[] {i, j});
    				boolean flag = true;
    				while (!dq.isEmpty()) {
    					int[] t = dq.pollFirst();
    					int x = t[0], y = t[1];
    					if (g[x - 1][y] == '#' && g[x + 1][y] == '#' && g[x][y - 1] == '#' && g[x][y + 1] == '#') flag = false;
    					for (int k = 0; k < 4; k++) {
    						int nx = t[0] + dx[k], ny = t[1] + dy[k];
    						if (nx < 0 || ny < 0 || nx >= n || ny >= n 
    								|| g[nx][ny] != '#' || vis[nx][ny]) continue;
    						vis[nx][ny] = true;
    						dq.offerLast(new int[] {nx, ny});
    					}
    				}
    				if (!flag) ans--;
    			}
    		}
    	}
    	out.println(ans);

        out.flush();
        in.close();
    }  
}