【BFS】HDU 1495 非常可乐

Problem Description

给你一瓶S体积的可乐,N和M容量的杯子,他们可以互相倒,问你能不能平分这瓶可乐,能的话,输出需要倒多少次,不能的话,输出NO.

代码: 就是情况多了点而已

#include<bits/stdc++.h>
using namespace std;
struct node
{
    int sum, u, v;
};
queue<node> q;
int s, n, m;
int vis[105][105];
void Bfs()
{
    int x, y, z, a, b, c, i;
    node t;
    q.push((node){s, 0, 0});//最开始的情况,入队列
    vis[0][0] = 1;//只需要标记后两个的体积即可
    while(!q.empty())
    {
        t = q.front();
        q.pop();
        a = t.sum, b = t.u, c = t.v;//分别表示,现在瓶子和两个被子的容量
        if((a == 0 && b == c) || (b == 0 && a == c) || (c == 0 && a == b)){//如果相等,输出结果
            printf("%d\n", vis[b][c] - 1);
            while(!q.empty())
            q.pop();
            return;
        }
        for(i = 0; i < 6; i++)//分为六种情况
        {
            if(i == 0 && b != n)//a倒入b
            {
                if(a + b >= n)//能倒满b
                {
                    x = a + b - n;
                    y = n;
                    z = c;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
                else//不能倒满b
                {
                    x = 0;
                    y = a + b;
                    z = c;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
            if(i == 1 && c != m)//a倒入c
            {
                if(a + c >= m)//能倒满c
                {
                    x = a + c - m;
                    y = b;
                    z = m;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
                else//不能倒满c
                {
                    x = 0;
                    y = b;
                    z = a + c;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
            if(i == 2 && a != s)//b倒入a
            {
                if(a + b < s)//不能倒满a
                {
                    x = a + b;
                    y = 0;
                    z = c;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
            if(i == 3 && c != m)//b倒入c
            {
                if(b + c >= m)//能倒满
                {
                    x = a;
                    y = b + c - m;
                    z = m;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
                else//不能倒满
                {
                    x = a;
                    y = 0;
                    z = b + c;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
            if(i == 4 && a != s)//c倒入a
            {
                if(a + c < s)//不能倒满a
                {
                    x = a + c;
                    y = b;
                    z = 0;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
            if(i == 5 && b != n)//c倒入b
            {
                if(b + c >= n)//能倒满
                {
                    x = a;
                    y = n;
                    z = b + c - n;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
                else//不能倒满
                {
                    x = a;
                    y = b + c;
                    z = 0;
                    if(!vis[y][z]) {
                    vis[y][z] = vis[b][c] + 1;
                    q.push((node){x, y, z});
                }
                }
            }
        }
    }
    printf("NO\n");//不能平分
}
int main()
{
    while(~scanf("%d %d %d", &s, &n, &m))
    {
        memset(vis, 0, sizeof(vis));
        if(!s && !n && !m) break;
        Bfs();
    }
    return 0;
}