广度优先搜索——USACO08FEB(洛谷 P2895)

2401_84046577

于 2024-04-21 11:47:06 发布

阅读量589

点赞数 16

分类专栏：程序员文章标签：宽度优先算法

本文链接：https://blog.csdn.net/2401_84046577/article/details/138029212

版权

题目出自**洛谷P2895** 同时也是USACO2008年的一道题。

其中主要问题是如何将问题转化为对应的数组或图？如何判断满足的条件情况？

以及设置的坑有哪些？

先看一下题目吧，在题目后面，我会给出具体的思路和避免的坑！

题目描述

Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a safe location (one that is never destroyed by a meteor) . She is currently grazing at the origin in the coordinate plane and wants to move to a new, safer location while avoiding being destroyed by meteors along her way.

The reports say that M meteors (1 ≤ M ≤ 50,000) will strike, with meteor i will striking point (Xi, Yi) (0 ≤ Xi ≤ 300; 0 ≤ Yi ≤ 300) at time Ti (0 ≤ Ti ≤ 1,000). Each meteor destroys the point that it strikes and also the four rectilinearly adjacent lattice points.

Bessie leaves the origin at time 0 and can travel in the first quadrant and parallel to the axes at the rate of one distance unit per second to any of the (often 4) adjace