HDU1495 非常可乐（BFS）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1495

题目大意：给定一瓶s的可乐，两个空杯子，容量分别为n和m，问是否能够评分这瓶可乐，可以平分求最小操作数

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

思路：最小操作数，基本BFS，6中情况倒水，注意判定和倒水的时候各个杯子剩余容量不要写错了

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>

using namespace std;

#define FOU(i,x,y) for(int i=x;i<=y;i++)
#define FOD(i,x,y) for(int i=x;i>=y;i--)
#define MEM(a,val) memset(a,val,sizeof(a))
#define PI acos(-1.0)

const double EXP = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const ll MINF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9+7;
const int N = 1e6+5;

int s,n,m;
int vis[105][105][105];

struct node
{
    int a,b,c;
    int step;
};

bool check(int a,int b,int c)
{
    if(vis[a][b][c]==1)
        return  false;
    return true;
}


int bfs()
{
    MEM(vis,0);
    node now,next;
    now.a=s;
    now.b=0;
    now.c=0;
    now.step=0;
    vis[now.a][now.b][now.c]=1;
    queue<node>q;
    q.push(now);
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if((now.a==now.b&&now.c==0)||(now.a==now.c&&now.b==0)||(now.b==now.c&&now.a==0))
            return now.step;
        //a往b倒
        if(now.a>n-now.b)
        {
            next.a=now.a-(n-now.b);
            next.b=n;
            next.c=now.c;
            next.step=now.step+1;
        }
        else
        {
            next.a=0;
            next.b=now.a+now.b;
            next.c=now.c;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

        //a往c倒
        if(now.a>m-now.c)
        {
            next.a=now.a-(m-now.c);
            next.b=now.b;
            next.c=m;
            next.step=now.step+1;
        }
        else
        {
            next.a=0;
            next.b=now.b;
            next.c=now.a+now.c;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

        //b往a倒
        if(now.b>s-now.a)
        {
            next.a=s;
            next.b=now.b-(s-now.a);
            next.c=now.c;
            next.step=now.step+1;
        }
        else
        {
            next.a=now.b+now.a;
            next.b=0;
            next.c=now.c;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

        //b往c倒
        if(now.b>m-now.c)
        {
            next.a=now.a;
            next.b=now.b-(m-now.c);
            next.c=m;
            next.step=now.step+1;
        }
        else
        {
            next.a=now.a;
            next.b=0;
            next.c=now.b+now.c;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

        //c往a倒
        if(now.c>s-now.a)
        {
            next.a=s;
            next.b=now.b;
            next.c=now.c-(s-now.a);
            next.step=now.step+1;
        }
        else
        {
            next.a=now.a+now.c;
            next.b=now.b;
            next.c=0;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

        //c往b倒
        if(now.c>n-now.b)
        {
            next.a=now.a;
            next.b=n;
            next.c=now.c-(n-now.b);
            next.step=now.step+1;
        }
        else
        {
            next.a=now.a;
            next.b=now.b+now.c;
            next.c=0;
            next.step=now.step+1;
        }
        if(check(next.a,next.b,next.c))
        {
            q.push(next);
            vis[next.a][next.b][next.c]=1;
        }

    }
    return -1;
}

int main()

{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    std::ios::sync_with_stdio(false);
    while(~scanf("%d%d%d",&s,&n,&m))
    {
        if(s==0&&n==0&&m==0)
            break;
        int ans=bfs();
        if(ans==-1)
            puts("NO");
        else
            printf("%d\n",ans);
    }
    return 0;
}