C - Catch That Cow

本题是bfs的应用，将所有的满足情况置入队列之中，然后再判断是否到达终点（满足条件）就行，注意本题不能使用stack来储存，只能使用queue

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
using namespace std;
int n,k,cnt;
const int maxn=200000+100;
int vis[maxn];
struct node{
	int x,cnt;
};
void bfs()
{
	queue<node> s;
	while(!s.empty())
		s.pop();
	node r;
	r.x=n,r.cnt=0;
	vis[n]=1;
	s.push(r);
	while(!s.empty())
	{
		node rt=s.front();s.pop();
		cnt=rt.cnt;
		//cout<<cnt<<endl;
		int xx=rt.x;
		if(xx==k)
		{
			printf("%d\n",cnt);continue;
		 } 
		if(xx<=k&&!vis[xx+1])
		{
			vis[xx+1]=1;
			node rhs;
			rhs.x=xx+1,rhs.cnt=cnt+1;
			s.push(rhs);
		}
		if(xx>=1&&!vis[xx-1])
		{
			vis[xx-1]=1;
			node rhs;
			rhs.x=xx-1,rhs.cnt=cnt+1;
			s.push(rhs);
		}
		if(xx<=k&&!vis[2*xx])
		{
			vis[2*xx]=1;
			node rhs;
			rhs.x=2*xx,rhs.cnt=cnt+1;
			s.push(rhs);
		}
	}
}
int main()
{
	//freopen("C.txt","r",stdin);
	scanf("%d %d",&n,&k);
	//cout<<n<<k<<endl;
	memset(vis,0,sizeof(vis));
	bfs();
	return 0;
}