1253：抓住那头牛

 bfs 刚开始以为是dp。。。。不是拓扑序啊。。。艹

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <map>
#include <set>
#include<iomanip>
#include <bits/stdc++.h>
/***************************************/
#define  ll  long long
#define int64 __int64
#define PI 3.1415927
#define INF 99999
const int maxn = 100001;
#define rep(i,n) for(int ;i=0;i<(n);i++)
using namespace std;
int dir8[][2]={{-2,1},{-2,-1},{-2,2},{-2,-2},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1},{2,-2},{2,2}};
int dir4[4][2]={{-1,0},{1,0},{0,-1},{0,1}};


char mp[310][110];

int vis[100000] ;
struct node {
int x ;
int step;
};int ans=99999999;

 int n,k;

 void bfs(node st)
 {
    queue<node>q;
    vis[st.x] =1;
    q.push(st);

     while(!q.empty())
     {
         node cur=q.front();
         q.pop();
         if (cur.x==k)
         {
cout<<cur.step<<endl;             return ;
         }
node nx;

nx.x=cur.x+1;
            if(0<=nx.x&&nx.x<maxn&&vis[nx.x]==0)
            {
                vis[nx.x]=1;
                nx.step=cur.step+1;
                q.push(nx);
            }

      nx.x=cur.x- 1;

  if(0<=nx.x&&nx.x<maxn&&vis[nx.x]==0)
            {
                vis[nx.x]=1;
                nx.step=cur.step+1;
                q.push(nx);
            }



      nx.x=cur.x*2;

  if(0<=nx.x&&nx.x<maxn&&vis[nx.x]==0)
            {
                vis[nx.x]=1;
                nx.step=cur.step+1;
                q.push(nx);
            }


     }



 }





int main()
{

 cin>>n>>k;
  if(k<n)
    {
        printf("%d",n-k);
        exit(0);
    }
memset(vis,0,sizeof(vis));
 node st;st.x=n;st.step=0;
 bfs(st);


   return 0;
}