POJ3278 Catch That Cow BFS入门
来源:互联网 发布:淘宝店铺装修的意义 编辑:程序博客网 时间:2024/06/07 12:02
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.
Source
USACO 2007 Open Silver
为求解最短路径,用BFS效果更好。
#include <iostream>#include <cstdio>#include <map>#include <set>#include <vector>#include <queue>#include <stack>#include <cmath>#include <algorithm>#include <cstring>#include <string>using namespace std;#define INF 0x3f3f3f3fconst int maxn=100000;typedef long long LL;int n,k;bool v[maxn+5];struct step{ int x; int steps; step(int xx,int s):x(xx),steps(s){}};queue<step> q;int main(){ while(~scanf("%d%d",&n,&k)){ memset(v,false,sizeof(v)); q.push(step(n,0)); v[n]=true; while(!q.empty()){ step s=q.front(); if(s.x==k){ printf("%d\n",s.steps); return 0; } if(s.x-1>=0&&!v[s.x-1]){ q.push(step(s.x-1,s.steps+1)); v[s.x-1]=true; } if(s.x+1<=maxn&&!v[s.x+1]){ q.push(step(s.x+1,s.steps+1)); v[s.x+1]=true; } if(2*s.x<=maxn&&!v[2*s.x]){ q.push(step(2*s.x,s.steps+1)); v[2*s.x]=true; } q.pop(); } } return 0;}
0 0
- POJ3278 Catch That Cow(BFS入门)
- POJ3278 Catch That Cow BFS入门
- POJ3278,Catch That Cow,BFS...
- poj3278 Catch That Cow---bfs
- poj3278 Catch That Cow bfs
- POJ3278 Catch That Cow(BFS)
- poj3278 Catch That Cow(BFS)
- POJ3278 Catch That Cow BFS
- [bfs] poj3278 Catch that Cow
- POJ3278 Catch That Cow(BFS)
- poj3278 Catch That Cow BFS
- POJ3278 Catch That Cow 【BFS】
- poj3278 Catch That Cow BFS
- Poj3278 Catch That Cow ( BFS
- Poj3278 BFS Catch That Cow
- POJ3278-Catch That Cow(bfs)
- Catch That Cow(POJ3278)(入门)
- poj3278 Catch That Cow(bfs搜索)
- Grunt个人学习
- windows dos合并文件命令 (copy与 type(这个更好用 ))
- 模式识别(Pattern Recognition)学习笔记(三十六)-- 动态聚类算法
- Scala开发环境搭建
- Android开发学习资料收集
- POJ3278 Catch That Cow BFS入门
- sensor框架解析
- WPF图片控件的旋转、缩放、翻转
- R install packages InternetOpenUrl failed: ''
- androidstudio 打不开模拟器的问题
- Java系列笔记 - Java 内存区域和GC机制
- Git 学习笔记四
- java 中的Scanner(非常详细不看后悔)
- Java学习笔记之反射(Reflection)