本文介绍了如何使用三维广度优先搜索（BFS）来解决HDU1240 Asteroids问题。在ACM竞赛中，这道题目考验了参赛者对空间搜索算法的理解和应用。
Asteroids!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3161 Accepted Submission(s): 2108
Problem Description
You're in space.
You want to get home.
There are asteroids.
You don't want to hit them.
You want to get home.
There are asteroids.
You don't want to hit them.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal
最低0.47元/天 解锁文章
扫一扫
4404
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
