Submission #6505081

---

Source Code Expand

#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;

struct du
{
	int t;
	int cnt;
};

int a,b;
const int dx[6]= {1,-1,5,-5,10,-10};
bool flag[50] = {0};

int main ()
{
	queue<du> s;
	cin >> a >> b;
	du temp;
	temp.t = a;
	temp.cnt = 0;
	flag[a] = true;
	if (a == b)
	{
		cout << 0 << endl;
		return 0;
	}
	s.push(temp);
	while (!s.empty())
	{
		du now = s.front();
		s.pop();
		if (now.t == b)
		{
			cout << now.cnt << endl;
			return 0;
		}
		for (int i = 0;i < 6;i++)
		{
			du next;
			next.t = now.t + dx[i];
			next.cnt = now.cnt + 1;
			if (next.t >= 0 && next.t <= 40 && !flag[next.t])
			{
				s.push(next);
				flag[next.t] = 1;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result