Submission #4199

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}


int main(){
	ios_base::sync_with_stdio(false);
	int A,B;
	cin >> A >> B;
	queue<int> Q;
	map<int,int> done;
	Q.push(A);
	done[A] = 0;
	while(Q.size()){
		int q = Q.front(); Q.pop();
		if( q == B ) cout << done[q] << endl;
		if( !done.count(q+10) ) Q.push(q+10) , done[q+10] = done[q]+1;
		if( !done.count(q-10) ) Q.push(q-10) , done[q-10] = done[q]+1;
		if( !done.count(q+1) ) Q.push(q+1) , done[q+1] = done[q]+1;
		if( !done.count(q-1) ) Q.push(q-1) , done[q-1] = done[q]+1;
		if( !done.count(q+5) ) Q.push(q+5) , done[q+5] = done[q]+1;
		if( !done.count(q-5) ) Q.push(q-5) , done[q-5] = done[q]+1;
	}
}

Submission Info

Judge Result