Submission #4569

---

Source Code Expand

#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
#include <locale>
#include <memory>
#include <stdexcept>
#include <utility>
#include <string>
#include <fstream>
#include <ios>
#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <streambuf>
#include <complex>
#include <numeric>
#include <valarray>
#include <exception>
#include <limits>
#include <new>
#include <typeinfo>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdlib>
#include <cstddef>
#include <cstdarg>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cwchar>
#include <cwctype>
using namespace std;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);
typedef long long ll;
typedef unsigned long long ull;

#define ALL(c) (c).begin(), (c).end()
#define CLEAR(v) memset(v,0,sizeof(v))
#define MP(a,b) make_pair((a),(b))
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define ABS(a) ((a)>0?(a):-(a))
template<class T> T MIN(const T& a, const T& b) { return a < b ? a : b; }
template<class T> T MAX(const T& a, const T& b) { return a > b ? a : b; }
template<class T> void MIN_UPDATE(T& a, const T& b) { if (a > b) a = b; }
template<class T> void MAX_UPDATE(T& a, const T& b) { if (a < b) a = b; }

const int diff[] = {-10, -5, -1, 1, 5, 10};

int solve(int A, int B) {
	set<int> open;
	set<int> close;
	open.insert(A);
	int answer = 1;
	while (true) {
		set<int> next;
		for (set<int>::iterator it = open.begin(), itEnd = open.end(); it != itEnd; ++it) {
			int from = *it;
			REP(i, 6) {
				int to = from + diff[i];
				if (to == B) {
					return answer;
				}

				if (close.count(to)) {
					continue;
				}
				close.insert(to);
				next.insert(to);
			}
		}
		swap(open, next);
		++answer;
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	int A, B;
	cin >> A >> B;
	if (A == B) {
		cout << 0 << endl;
		return 0;
	}
	cout << solve(A, B) << endl;
}

Submission Info

Judge Result