POJ 3278Catch That Cow (bfs)
来源:互联网 发布:知乎营销案例 编辑:程序博客网 时间:2024/06/08 12:14
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
Output
Sample Input
5 17
Sample Output
4
Hint
题意:农夫在位置n,他可以走x-1,x+1,2*x.最小走多少步可以找到位置在k的牛
做法:bfs
要注意的地方有两个,边界条件,和结构体的入队。
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<queue>using namespace std;#define MAX_N 100010struct john{int x;int t;};int main(){int n,k;while (cin >> n >> k) {if (n >= k) //比他小的情况和等于的情况直接就可以求出来了{cout << n-k<< endl;continue;}//初始化queue<john>q;john start;int v[MAX_N] = {0};start.x = n;start.t = 0;v[n] = 1;q.push(start);while (!q.empty()){if (q.front().x == k)break;//找到就退出去if (q.front().x + 1 < MAX_N) { //边界一定要考虑 不然会runtime errorif (v[q.front().x + 1] == 0){john temp;//要重新定义一个变量 因为queue的对象是引用,如果不重新定义,会修改了队列里的数据v[q.front().x + 1] = 1;temp.x = q.front().x + 1;temp.t = q.front().t + 1;q.push(temp);}}if (q.front().x - 1 >= 0) {if (v[q.front().x - 1] == 0){john temp;v[q.front().x - 1] = 1;temp.x = q.front().x - 1;temp.t = q.front().t + 1;q.push(temp);}}if (q.front().x * 2 < MAX_N){if(v[q.front().x * 2] == 0){john temp;v[q.front().x * 2] = 1;temp.x = q.front().x * 2;temp.t = q.front().t + 1;q.push(temp);}}q.pop();}cout << q.front().t << endl;}return 0;}
- 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)
- POJ 3278Catch 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 3278Catch That Cow (bfs)
- spirng aop依赖库下载
- pip源配置
- CodeForces
- IntelliJ IDEA注册激活
- 给定一个字符串类型的数组,数组元素值为数字组成的字符串对象, 将数组元素的进行拼接,拼接之后的数字值是最大的
- POJ 3278Catch That Cow (bfs)
- #Oracle-01
- CodeForces 835B The number on the board
- [转]STL 之set不允许元素重复,且从小到大排列
- 2017多校联合训练第3场第5题
- 利用tensorflow一步一步实现基于MNIST 数据集进行手写数字识别的神经网络,逻辑回归
- linkedList特有的方法
- 最大流dinic算法的优化模板 当前弧优化,多路增广
- 超好用的网络抓包框架(Windivert)之二(语言)