Submission #1163014

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define long long long // for codeforces

int main(){
  int a,b;
  cin>>a>>b;
  vector<int> d = {1,-1,5,-5,10,-10};

  queue<int> q,qq;
  q.push(a);
  qq.push(0);

  set<int> checked;
  checked.insert(a);
  while(q.front()!=b){
    int c = q.front(); q.pop();
    int l = qq.front(); qq.pop();
    for(auto dd : d){
      if(checked.count(c+dd)==0){
        q.push(c+dd);
        qq.push(l+1);
        checked.insert(c+dd);
      }
    }
  }

  cout << qq.front() << endl;

  return 0;
}

Submission Info

Judge Result