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?
5 17Sample Output
4Hint
那么,约翰需要多少时间抓住那只牛呢?
代码:
using namespace std;const long long MAXN = 500001;bool visit[MAXN];struct xx{long long s, cnt;}a[MAXN];int main(){long long n, k, d = 0, zt=1, i=1;cin >> n >> k;a[1].s = n;while (1){if (a[i].s == k){cout << a[i].cnt << endl;break;}if (a[i].s + 1<MAXN)if (visit[a[i].s + 1] == false){zt++;a[zt].s = a[i].s + 1;a[zt].cnt = a[i].cnt + 1;visit[a[z