Submission #6900641

---

Source Code Expand

#include<iostream>
#include<cstring>
using namespace std;
int a,b,q[100001][3],s[100001];
int d[6]={1,-1,5,-5,10,-10};
int head=1,tail=1;
void bfs(){
	while(head<=tail){
		for(int i=0;i<6;i++){
			int x=q[head][1]+d[i];
			if(s[x]==-1&&x<100001&&x>-1){
				s[x]=q[head][2]+1;
				tail++;
				q[tail][1]=x;
				q[tail][2]=s[x];
				if(s[b]>0){
					cout<<s[b]<<endl;
					return;
				}
			}
		}
	head++;	
	}
}
int main(){
	cin>>a>>b;
	memset(s,-1,sizeof(s));
	if(a==b){
		cout<<0<<endl;
		return 0;
	}
	q[1][1]=a,q[1][2]=0;
	bfs();
	return 0;
	
}

Submission Info

Judge Result