hdu1495 非常可乐【bfs】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1495
题意：中文题
解析：反正就是3个杯子倒来倒去，那么每次都试一下，直接bfs就好，写的过程中耐心一些，就可以了

#include <bits/stdc++.h>
using namespace std;
struct node
{
    int a,b,c;
    int step;
    node() {}
    node(int _a,int _b,int _c,int _step)
    {
        a = _a;
        b = _b;
        c = _c;
        step = _step;
    }
};
int vis[105][105][105];
int s,n,m;
int bfs(int a,int b,int c)
{
    memset(vis,0,sizeof(vis));
    queue<node>q;
    q.push(node(a,b,c,0));
    vis[a][b][c] = 0;
    while(!q.empty())
    {
        node now = q.front();
        q.pop();
        if(vis[now.a][now.b][now.c])
            continue;
        vis[now.a][now.b][now.c] = 1;
        if(now.a==now.b && now.a==s/2)
            return now.step;
        if(now.b==now.c && now.b==s/2)
            return now.step;
        if(now.a==now.c && now.a==s/2)
            return now.step;
        int detaa = s-now.a;
        int detab = n-now.b;
        int detac = m-now.c;
        if(now.a>0)
        {
            if(now.a>detab)
                q.push(node(now.a-detab,n,now.c,now.step+1));
            else
                q.push(node(0,now.b+now.a,now.c,now.step+1));
            if(now.a>detac)
                q.push(node(now.a-detac,now.b,m,now.step+1));
            else
                q.push(node(0,now.b,now.c+now.a,now.step+1));
        }
        if(now.b>0)
        {
            if(now.b>detaa)
                q.push(node(s,now.b-detaa,now.c,now.step+1));
            else
                q.push(node(now.a+now.b,0,now.c,now.step+1));
            if(now.b>detac)
                q.push(node(now.a,now.b-detac,m,now.step+1));
            else
                q.push(node(now.a,0,now.c+now.b,now.step+1));
        }
        if(now.c>0)
        {
            if(now.c>detaa)
                q.push(node(s,now.b,now.c-detaa,now.step+1));
            else
                q.push(node(now.a+now.c,now.b,0,now.step+1));
            if(now.c>detab)
                q.push(node(now.a,n,now.c-detab,now.step+1));
            else
                q.push(node(now.a,now.b+now.c,0,now.step+1));
        }
    }
    return -1;
}
int main(void)
{
    while(~scanf("%d %d %d",&s,&n,&m))
    {
        if(!s&&!n&&!m)
            break;
        if(s%2)
            puts("NO");
        else
        {
            int ans = bfs(s,0,0);
            if(ans==-1)
                puts("NO");
            else
                printf("%d\n",ans);
        }
    }
    return 0;
}