Submission #6950750

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
using ll = long long int;
const lint INF = 1001001001001001LL;
const lint MOD = 1000000007LL;
int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

void yes(){ cout << "yes" << endl; }
void Yes(){ cout << "Yes" << endl; }
void YES(){ cout << "YES" << endl; }
void no(){ cout << "no" << endl; }
void No(){ cout << "No" << endl; }
void NO(){ cout << "NO" << endl; }
void possible(){ cout << "possible" << endl; }
void Possible(){ cout << "Possible" << endl; }
void POSSIBLE(){ cout << "POSSIBLE" << endl; }
void impossible(){ cout << "impossible" << endl; }
void Impossible(){ cout << "Impossible" << endl; }
void IMPOSSIBLE(){ cout << "IMPOSSIBLE" << endl; }

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for(int i = s; i < t; i++)
#define all(a) a.begin(),a.end()

int main(){
  
  int a, b; cin >> a >> b;
  a += 100;
  b += 100;
  vector<int> dp(200, 10101010);
  vector<int> vec(6);
  vec[0] = 1;
  vec[1] = -1;
  vec[2] = 5;
  vec[3] = -5;
  vec[4] = 10;
  vec[5] = -10;


  queue<pair<int, int>> q;
  dp[a] = 0;
  q.push({a, 0});
  while(!q.empty()){
    int cur = q.front().first;
    int cost = q.front().second;
    q.pop();

    if(cur == b){
      cout << cost << endl;
      return 0;
    }
    rep(i, 6){
      int nxt = cur + vec[i];
      if(dp[nxt] == 10101010){
        dp[nxt] = cost + 1;
        q.push({nxt, cost + 1});
      }
    }
  }
  
  
  return 0;
}

Submission Info

Judge Result