Submission #1868545

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
bool used[50];
typedef pair<int,int>P;
int main(){
  int a,b,t[]={-10,-5,-1,1,5,10};
  cin>>a>>b;
  queue<P>q;
  used[a]=1;
  q.push(P(a,0));
  while(!q.empty()){
    P p=q.front();q.pop();
    if(p.first==b){
      cout<<p.second<<endl;
      return 0;
    }
    for(int i=0;i<6;i++){
      int x=p.first+t[i];
      if(!used[x]){
        used[x]=1;
        q.push(P(x,p.second+1));
      }
    }
  }
}

Submission Info

Judge Result