Submission #6430314

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int a,b,bj;
int vis[10100];

queue< pair<int,int> > q;

void bfs(int n){
	while(!q.empty()) q.pop();
	q.push(make_pair(n,0));
	while(!q.empty()){
		int x=q.front().first;
		int t=q.front().second;
		int y;
		q.pop();
		for(int i=1;i<=6;i++){
			if(i==1) y=x+1;
			if(i==2) y=x-1;
			if(i==3) y=x+5;
			if(i==4) y=x-5;
			if(i==5) y=x+10;
			if(i==6) y=x-10;
			if(y>=0&&y<=40&&vis[y]==0){
				q.push(make_pair(y,t+1));
				vis[y]=1;
				if(y==b){
					cout<<t+1<<endl;
					bj=0;
					break;
				}
			}
		}
		if(bj==0) break;
	}
	
}
int main(){
	memset(vis,0,sizeof(vis));
	cin>>a>>b;
	bj=1;
	if(a==b){
		cout<<0<<endl;
		return 0;
	}
	bfs(a);
	return 0;
}

Submission Info

Judge Result