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 <iostream>
#include <queue>
#include <cstring>
using namespace std;
typedef struct
{
int s;
int n;
int m;
int step;
}node;
int s,n,m;
int vis[105][105][105];
int bfs()
{
queue <node> q;
memset(vis, 0, sizeof(vis));
node x;
x.s = s;
x.n = 0;
x.m = 0;
x.step = 0;
vis[x.s][x.n][x.m] = 1;
q.push(x);
while(!q.empty())
{
x = q.front();
q.pop();
if((x.s == x.n && x.s == s / 2)||(x.s == x.m&&x.s == s / 2) || (x.m == x.n && x.m == s / 2))
return x.step;
node v;
//s -> n;
if(x.s&&x.n != n)//如果n杯子没满,且s中还有可乐
{
if(x.s > n - x.n)//s中可乐大于n杯子的剩余容积
{
v.s = x.s - (n - x.n);
v.n = n;
v.m = x.m;
}
else
{
v.s = 0;
v.n = x.n + x.s;
v.m = x.m;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
//s -> m;
if(x.s&&x.m != m)//如果m杯子没满,且s中还有可乐
{
if(x.s > m - x.m)//s中可乐大于m杯子的剩余容积
{
v.s = x.s - (m - x.m);
v.n = x.n;
v.m = m;
}
else
{
v.s = 0;
v.n = x.n;
v.m = x.m + x.s;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
//n -> m;
if(x.n&&x.m != m)//如果m杯子没满,且n中还有可乐
{
if(x.n > m - x.m)//n中可乐大于m杯子的剩余容积
{
v.s = x.s;
v.n = x.n - (m - x.m);
v.m = m;
}
else
{
v.s = x.s;
v.n = 0;
v.m = x.m + x.n;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
//n -> s;
if(x.n&&x.s != s)//如果s杯子没满,且n中还有可乐
{
if(x.n > s - x.s)//n中可乐大于s杯子的剩余容积
{
v.s = s;
v.n = x.n - (s - x.s);
v.m = x.m;
}
else
{
v.s = x.s + x.n;
v.n = 0;
v.m = x.m;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
//m -> s;
if(x.m&&x.s != s)//如果s杯子没满,且m中还有可乐
{
if(x.m > s - x.s)//m中可乐大于s杯子的剩余容积
{
v.s = s;
v.n = x.n;
v.m = x.m - (s - x.s);
}
else
{
v.s = x.s + x.m;
v.n = x.n;
v.m = 0;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
//m -> n;
if(x.m&&x.n != n)//如果n杯子没满,且m中还有可乐
{
if(x.m > n - x.n)//m中可乐大于n杯子的剩余容积
{
v.s = x.s;
v.n = n;
v.m = x.m - (n - x.n);
}
else
{
v.s = x.s;
v.n = x.n + x.m;
v.m = 0;
}
if(!vis[v.s][v.n][v.m])
{
vis[v.s][v.n][v.m] = 1;
v.step = x.step + 1;
q.push(v);
}
}
}
return 0;
}
int main()
{
while(cin>>s>>n>>m)
{
if(s == 0&&m == 0&&n == 0)
break;
if(s%2)
{
cout<<"NO"<<endl;
continue;
}
/* if(n < m)//可有可无
{
int t = m;
m = n;
n = t;
}*/
int ans = bfs();
if(ans)
cout<<ans<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}