Catch That Cow

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 77652   Accepted: 24538 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 #include<cstdio> #include<algorithm> #include<cstdlib> #include<queue> #include<cstring> using namespace std; int n, k; int map[1000010]; struct node { int x; int step; }; int check(int m) { if (m < 0 || m >= 100050 || map[m]) { return 0; } return 1; } int bfs(int n) { queue<node>Q; node a, next; map[n] = 1; a.x = n; a.step = 0; Q.push(a); while (!Q.empty()) { a = Q.front(); Q.pop(); if (a.x == k) { return a.step; } next.x = a.x + 1; if (check(next.x)) { map[next.x] = 1; next.step = a.step + 1; Q.push(next); } next.x = a.x - 1; if (check(next.x)) { map[next.x] = 1; next.step = a.step + 1; Q.push(next); } next.x = a.x * 2; if (check(next.x)) { map[next.x] = 1; next.step = a.step + 1; Q.push(next); } } } int main() { int ans; while (~scanf("%d %d", &n, &k)) { memset(map, 0, sizeof(map)); ans = bfs(n); printf("%d\n", ans); } return 0; }