概述:大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
思路:BFS求解,题目不难,但是十分的冗杂(有水题的嫌疑),做起来很费事,我参考了课件和其他人的代码才能写出来。
感想:烦。
#include <string.h>
#include <stdio.h>
#include <queue>
using namespace std;
int s, n, m;
int visit[105][105][105];
struct node
{
int s, n, m, move;
};
int check(int x, int y, int z)//平分条件
{
if (x == 0 && y == z)
return 1;
if (y == 0 && x == z)
return 1;
if (z == 0 && x == y)
return 1;
return 0;
}
int bfs()
{
queue<node> Q;
node a, next;
a.s = s;
a.n = 0;
a.m = 0;
a.move = 0;
visit[s][0][0] = 1;
Q.push(a);
while (!Q.empty())
{
a = Q.front();
Q.pop();
if (check(a.s, a.n, a.m))
return a.move;
if (a.n)//当n杯中还有
{
if (a.n>s - a.s)//将n杯倒入s杯中能将s杯倒满
{
next = a;
next.n = next.n - (s - a.s);
next.s = s;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else//将n杯倒入s杯中不能将s杯倒满
{
next = a;
next.s = next.n + next.s;
next.n = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
if (a.n>m - a.m)//将n杯倒入m杯中能将m杯倒满
{
next = a;
next.n = next.n - (m - a.m);
next.m = m;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else//将n杯倒入m杯中不能将m杯倒满
{
next = a;
next.m = next.n + next.m;
next.n = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
}
if (a.m)//同上
{
if (a.m>s - a.s)
{
next = a;
next.m = next.m - (s - a.s);
next.s = s;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else
{
next = a;
next.s = next.m + next.s;
next.m = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
if (a.m>n - a.n)
{
next = a;
next.m = next.m - (n - a.n);
next.n = n;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else
{
next = a;
next.n = next.m + next.n;
next.m = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
}
if (a.s)//同上
{
if (a.s>n - a.n)
{
next = a;
next.s = next.s - (n - a.n);
next.n = n;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else
{
next = a;
next.n = next.s + next.n;
next.s = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
if (a.s>m - a.m)
{
next = a;
next.s = next.s - (m - a.m);
next.m = m;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
else
{
next = a;
next.m = next.m + next.s;
next.s = 0;
if (!visit[next.s][next.n][next.m])
{
next.move = a.move + 1;
Q.push(next);
visit[next.s][next.n][next.m] = 1;
}
}
}
}
return 0;
}
int main()
{
int ans;
while (~scanf("%d%d%d", &s, &n, &m), s || n || m)
{
if (s % 2)//奇数肯定不能平分,因为被子是整数体积大小
{
printf("NO\n");
continue;
}
memset(visit, 0, sizeof(visit));
ans = bfs();
if (ans)
printf("%d\n", ans);
else
printf("NO\n");
}
return 0;
}