Problem : [Usaco2007 Open]Catch That Cow 抓住那只牛

最新推荐文章于 2021-11-10 18:30:43 发布

Cancelleds

最新推荐文章于 2021-11-10 18:30:43 发布

阅读量229

点赞数

分类专栏：各种C/题目解析

本文链接：https://blog.csdn.net/ebirth/article/details/96484658

版权

农夫约翰需要抓住一只站在数轴上的逃牛。他可以通过步行或瞬移来移动。步行可以在1分钟内移动到X-1或X+1的位置，瞬移可以在1分钟内移动到2X的位置。若奶牛不动，求约翰抓住奶牛的最短时间。输入包含两个整数N和K，分别表示约翰和奶牛的初始位置。输出是最短时间（以分钟计）。示例输入显示约翰从5开始，奶牛在17，最快路径为5-10-9-18-17，用时4分钟。解决此问题可以使用BFS搜索算法。

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

Problem O: [Usaco2007 Open]Catch That Cow 抓住那只牛

题目演示

Description
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 <= N <= 100,000) on a number line and the cow is at a point K (0 <= K <= 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting. * Walking: FJ can move from any point X to the points X-1 or X+1 in a single minute * Teleporting: FJ can move from any point X to the point 2*X in a single minute. If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

农夫约翰被通知，他的一只奶牛逃逸了！所以他决定，马上幽发，尽快把那只奶牛抓回来,他们都站在数轴上．约翰在N(O≤N≤100000)处，奶牛在K(O≤K≤100000)处．约翰有两种办法移动，步行和瞬移：步行每秒种可以让约翰从x处走到x+1或x-1处；而瞬移则可让他在1秒内从x处消失，在2x处出现．然而那只逃逸的奶牛，悲剧地没有发现自己的处境多么糟糕，正站在那儿一动不动．那么，约翰需要

最低0.47元/天解锁文章

Cancelleds

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Problem : [Usaco2007 Open]Catch That Cow 抓住那只牛

Problem O: [Usaco2007 Open]Catch That Cow 抓住那只牛题目演示讲解部分代码部分题目演示DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N ...
复制链接

扫一扫

专栏目录