【USACO】Space Exploration dfs

esxwht

于 2021-05-16 12:03:14 发布

阅读量335

点赞数 1

文章标签： c++ dfs usaco

本文链接：https://blog.csdn.net/esxwht/article/details/116887134

版权

这篇博客介绍了如何使用DFS算法解决USACO中的空间探索问题，即在给定的N x N网格中统计相连的1 x 1的'asteroid'单元格形成的不同岛屿数量。通过提供一个10 x 10的示例地图和对应的DFS代码，博主解释了如何计算出整个空间区域中的独立asteroid数量。

摘要由CSDN通过智能技术生成

【USACO】Space Exploration
时间限制: 1.000 Sec 内存限制: 64 MB
题目描述：
Farmer John’s cows have finally blasted off from earth and are now floating around space in their Moocraft. The cows want to reach their fiery kin on Jupiter’s moon of Io, but to do this they must first navigate through the dangerous asteroid belt. Bessie is piloting the craft through this treacherous N x N (1 <= N <= 1,000) sector of space. Asteroids in this sector comprise some number of 1 x 1 squares of space-rock connected along their edges (two squares sharing only a corner count as two distinct asteroids). Please help Bessie maneuver through the field by counting the number of distinct asteroids in the entire sector. Consider the 10 x 10 space shown below on the left. The '*'s represent asteroid chunks, and each ‘.’ represents a .vast void of empty space. The diagram on the right shows an arbitrary numbering applied to the asteroids.

           ...**.....           ...11.....
           .*........           .2........
           ......*...           ......3...
           ...*..*...           ...3..3...
           ..*****...           ..33333...
           ...*......           ...3......
           ....***...           ....444...
           .*..***...           .5..444...
           .....*...*          ......4...6
           ..*.......          ..7........

It’s easy to see there are 7 asteroids in this sector.
/*
给出一张NN的地图（1 <= N <= 1,000），统计其中有多少座岛屿。下图为N=10时的地图，图中“”表示石块，“.”表示海水。
*/
输入：