HDU-1495：非常可乐（BFS）

传送门
题目描述

Problem Description
大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是没有刻度的，且 S==N+M，101＞S＞0，N＞0，M＞0) 。聪明的ACMER你们说他们能平分吗？如果能请输出倒可乐的最少的次数，如果不能输出"NO"。

Input
三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量，以"0 0 0"结束。

Output
如果能平分的话请输出最少要倒的次数，否则输出"NO"。

Sample Input
7 4 3
4 1 3
0 0 0

Sample Output
NO
3

代码实现

#include<map>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<set>
#include<vector>
#include<numeric>
#include<string>
using namespace std;
#define ll long long
int visited[101][101][101];
int S, M, N, res;
bool judge = false;
struct Vec
{
	int s, m, n, cnt;
	Vec(int a, int b, int c, int d)
	{
		this->s = a;
		this->n = b;
		this->m = c;
		this->cnt = d;
	}
};
void bfs()
{
	queue<Vec>q;
	q.push(Vec(S, 0, 0, 0));
	while (!q.empty())
	{
		Vec cur = q.front();
		q.pop();
		if ((cur.s == cur.m && cur.n == 0) || (cur.n == cur.s && cur.m == 0) || (cur.m == cur.n && cur.s == 0))
		{
			judge = true;
			res = cur.cnt;
			return;
		}
		if (cur.s != 0)
		{
			//s->n
			int new_s = (cur.s + cur.n) > N ? (cur.s + cur.n) - N : 0;
			int new_n = (cur.s + cur.n) > N ? N : (cur.s + cur.n);
			int new_m = cur.m;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
			//s->m
			new_s = (cur.s + cur.m) > M ? (cur.s + cur.m) - M : 0;
			new_m = (cur.s + cur.m) > M ? M : (cur.s + cur.m);
			new_n = cur.n;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
		}
		if (cur.m != 0)
		{
			//m->n
			int new_m = (cur.m + cur.n) > N ? (cur.m + cur.n) - N : 0;
			int new_n = (cur.m + cur.n) > N ? N : (cur.m + cur.n);
			int new_s = cur.s;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
			//m->s
			new_s = cur.s + cur.m;
			new_m = 0;
			new_n = cur.n;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
		}
		if (cur.n != 0)
		{
			//n->m
			int new_n = (cur.m + cur.n) > M ? (cur.m + cur.n) - M : 0;
			int new_m = (cur.m + cur.n) > M ? M : (cur.m + cur.n);
			int new_s = cur.s;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
			//n->s
			new_s = cur.s + cur.n;
			new_n = 0;
			new_m = cur.m;
			if (visited[new_s][new_n][new_m] == 0)
			{
				visited[new_s][new_n][new_m] = 1;
				q.push(Vec(new_s, new_n, new_m, cur.cnt + 1));
			}
		}
	}
}
int main()
{
	while (~scanf("%d%d%d", &S, &N, &M))
	{
		if (S == 0 && N == 0 && M == 0)
			break;
		memset(visited, 0, sizeof(visited));
		judge = false;
		bfs();
		if (judge)
			cout << res << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}