Submission #1406009

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1e8;
int main(){
  int A, B;
  cin >> A >> B;
  A += 1000;
  B += 1000;
  int d[2000];
  FOR(i,0,2000) d[i] = inf;
  d[A] = 0;
  int v[6] = {1,5,10,-1,-5,-10};
  queue<P> que;
  que.push(P(A,0));
  while(!que.empty()){
    P p = que.front(); que.pop();
    if(d[p.first] < p.second) continue;
    FOR(i,0,6){
      int next = p.first + v[i];
      if(next < 0 || next >= 2000) continue;
      if(d[next] > d[p.first] + 1){
        d[next] = d[p.first] + 1;
        que.push(P(next, d[next]));
      }
    }
  }
  cout << d[B] << endl;
  return 0;
}

Submission Info

Judge Result