POJ-3278 Catch That Cow (BFS入门题
来源:互联网 发布:中国联通网络测速 编辑:程序博客网 时间:2024/04/30 17:13
Catch That Cow
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 93780
Accepted: 29419
Description
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN (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 pointsX - 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.
Source
USACO 2007 Open Silver
#include <iostream>#include<stdio.h>#include<queue>#include<string.h>using namespace std;const int SIZE=100005;int step[3*SIZE]; //防止数组越界的保险,正常没有3也可以int check[3*SIZE];void bfs(int s,int e){ queue<int> q; while(!q.empty()) q.pop(); q.push(s); step[s]=0; check[s]=1; while(!q.empty()) { int now=q.front(); if(now==e) break; q.pop(); if(!check[now+1]&&now+1<=100000) { q.push(now+1); step[now+1]=step[now]+1; check[now+1]=1; //这个地方我觉得是BFS最需要注意的,如果写在最上方的话,后面就会有一些情况第二次进入队列在步数上第二次计算就会有问题。 } if(!check[now-1]&&now-1>=0) { q.push(now-1); step[now-1]=step[now]+1; check[now-1]=1; } if(!check[now*2]&&now*2<=100000) { q.push(now*2); step[now*2]=step[now]+1; check[now*2]=1; } }}int main(){ int m,n; while(cin>>m>>n) { if(m>=n) { cout<<m-n<<endl; continue; } memset(step,0,sizeof(step)); memset(check,0,sizeof(check)); bfs(m,n); cout<<step[n]<<endl; } return 0;}
- POJ - 3278 Catch That Cow (bfs,入门搜索题)
- POJ-3278 Catch That Cow (BFS入门题
- 3278 Catch That Cow BFS入门题
- poj 3278 Catch That Cow BFS
- poj 3278 Catch That Cow BFS
- POJ 3278 Catch That Cow BFS
- poj 3278 bfs(Catch That Cow)
- poj 3278 Catch That Cow(bfs)
- POJ 3278 Catch That Cow bfs
- POJ 3278 Catch That Cow 【bfs+队列】
- POJ 3278 Catch That Cow (BFS)
- POJ 3278 Catch That Cow(BFS)
- poj 3278 Catch That Cow bfs
- poj 3278 Catch That Cow (BFS剪枝)
- POJ 3278 Catch That Cow[BFS]
- Poj 3278 Catch That Cow 裸bfs
- POJ 3278 Catch That Cow(图论:BFS)
- POJ 3278 Catch That Cow (BFS)
- maven的使用
- 【OpenStack源码分析之十】虚机启动流程中Nova Compute与周边组件的交互
- win10下python中的easy_install和pip的安装方法
- 为了安全~
- 学习心得——数组作为函数参数后sizeof获取不到数组在内存中所占字节数的问题
- POJ-3278 Catch That Cow (BFS入门题
- Android中简单的通知
- Win10环境下.NET连接Oracle数据库进行开发,编译报错175
- MFC原理简介,新手看懂MFC代码
- qt5.5版本的creator构建套件自动检测为警告
- Ubuntu16.04LTS安装Tensorflow篇
- Day01 安装虚拟机
- 使用jsencrypt实现参数的前端加密
- Ubuntu 安装Cuda8后,分辨率不能调节的解决方案