Submission #2225081

---

Source Code Expand

#include<bits/stdc++.h>
 
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
 
using namespace std;
 
struct Data {
  int cur,cost;
  bool operator < ( const Data &data ) const { return cost > data.cost; }
};
 
const int IINF = INT_MAX;
const int DIFF = 60;
int dp[120],cost[6] = {1,5,10,-1,-5,-10};
 
int main(){
  int a,b;
  cin >> a >> b;
  rep(i,120) dp[i] = IINF;
  if( a > b ) swap(a,b);
  deque<Data> deq;
  dp[a] = 0;
  deq.push_back((Data){a,0});
  while( !deq.empty() ){
    Data data = deq.front(); deq.pop_front();
    if( dp[data.cur] < data.cost ) continue;
    rep(i,6){
      int next = data.cur + cost[i];
      if( 0 > next ) continue;
      if( dp[next] > data.cost+1 ) {
        dp[next] = data.cost+1;
        deq.push_back((Data){next,dp[next]});
      }
    }
  }
  cout << dp[b] << endl;
  return 0;
}

Submission Info

Judge Result