Submission #6393331

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int main()
{
	queue<int> q;
	int a,b,t[7]={0,-1,1,-5,5,10,-10},u=0,ans=1,s,bj[100];
	memset(bj,0,sizeof(bj));
	cin>>a>>b;
	if(a==b)
	{
		cout<<"0";
		return 0;
	}
	bj[a+50]=1;
	q.push(a);
	for(int i=1;i<=6;i++)
	{
	  q.push(a+t[i]);
	  bj[a+t[i]+50]=1;
	}
	q.pop();
	s=q.size();
	while(q.front()!=b)
	{
	  u++;
	  for(int i=1;i<=6;i++)
	  {
	   	if(bj[q.front()+t[i]+50]==0)
	  	 q.push(q.front()+t[i]);
	  }
      q.pop();
      if(u==s)
      {
      	ans++;
      	u=0;
      	s=q.size();
	  }
	}
	cout<<ans;
	return 0;
}

Submission Info

Judge Result