搜索-G
来源:互联网 发布:淘宝用什么刷流量 编辑:程序博客网 时间:2024/05/16 08:53
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?
Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input
5 17
Sample Output
4
Hint
The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.
2、思路:直接广搜即可.
3、代码:
#include<iostream>#include<queue>#include<string>#include<string.h>using namespace std;int main(){int a,b,flag=0;int t=1;int tt=1;int d,dd,ddd;int ttt=1;int i;int x[200002];memset(x,0,sizeof(x));cin>>a>>b;queue<long> q;q.push(a);if(a==b)cout<<0<<endl;elsewhile(1){tt=ttt;ttt=0;for(i=0;i<tt;i++){d=q.front()+1;dd=q.front()-1;ddd=q.front()*2;if(d==b||dd==b||ddd==b){flag=1;break;}if(d>=0&&d<=200002&&x[d]==0){q.push(d);ttt++;x[d]=1;}if(dd>=0&&dd<=200002&&x[dd]==0){q.push(dd);ttt++;x[dd]=1;}if(ddd>=0&&ddd<=200002&&x[ddd]==0){q.push(ddd);ttt++;x[ddd]=1;}q.pop();}if(flag==1){cout<<t<<endl;break;}t++;}return 0;}4、总结:一定要注意每次搜索记得将每个点标记,说明这个点走过了,不然会超时...
阅读全文
0 0
- 搜索 G
- 搜索--G
- 搜索 G
- 搜索-G
- 搜索-G
- 搜索 G
- 搜索-G
- 搜索-G
- gcc g++ 搜索 路径
- gcc/g++搜索路径
- gcc/g++搜索路径
- 搜索专题 G
- 搜索 G题
- 搜索练习题G-07
- Problem G: 逃脱(搜索)
- linux g++ 库文件搜索路径
- Gym 100886G Maximum Product(搜索)
- 【搜索入门专题1】hdu1548 G
- java自动装箱、拆箱
- 随机森林 random forest
- bzoj3265 noi2008志愿者招募 【线性规划】
- 图的深度优先遍历(递归与非递归算法)和广度优先遍历
- 判断ffmpeg读到的packet是否为关键帧
- 搜索-G
- 查看csdn自己收藏的文章
- Linux设备驱动中的阻塞和非阻塞I/O
- Tfs问题
- 勒索病毒未死,新病毒或又要来袭
- Php的函数如何声明?
- 总结篇-Spring-data-jpa 框架
- (151)无需切线空间应用凹凸贴图
- python爬虫2之简单模拟浏览器