hdu 1495 非常可乐

点击打开链接
//bfs求最少次数
#include <iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
int a,b,c;
bool done[102][102][102];
//6个状态的转移
struct state{
int x,y,z,step;
state(int x,int y,int z,int step):x(x),y(y),z(z),step(step) {}
};
int bfs()
{
    memset(done,false,sizeof(done));
    queue<state>pq;
    pq.push(state(a,0,0,0));
    done[a][0][0]=true;
    //注意避免无限循环
    while(!pq.empty())
    {
        state ss=pq.front();
        pq.pop();
        if((ss.x==ss.y&&!ss.z)||(ss.x==ss.z&&!ss.y)||(ss.y==ss.z&&!ss.x)) return ss.step;
        //a->b
        int f1=ss.x-b+ss.y;
        if(f1>=0) {
                if(!done[f1][b][ss.z]) { pq.push(state(f1,b,ss.z,ss.step+1)); done[f1][b][ss.z]=true; }
        }
        else {
                if(!done[0][ss.y+ss.x][ss.z]) { pq.push(state(0,ss.y+ss.x,ss.z,ss.step+1)); done[0][ss.y+ss.x][ss.z]=true; }
        }
        //b->a
        int f2=ss.y-a+ss.x;
        if(f2>=0) {
                if(!done[a][f2][ss.z]) { pq.push(state(a,f2,ss.z,ss.step+1)); done[a][f2][ss.z]=true; }
        }
        else {
                if(!done[ss.x+ss.y][0][ss.z]) { pq.push(state(ss.x+ss.y,0,ss.z,ss.step+1)); done[ss.x+ss.y][0][ss.z]=true; }
        }
        //a->c
        int f3=ss.x-c+ss.z;
        if(f3>=0) {
                if(!done[f3][ss.y][c]) { pq.push(state(f3,ss.y,c,ss.step+1)); done[f3][ss.y][c]=true; }
        }
        else {
                if(!done[0][ss.y][ss.z+ss.x]) { pq.push(state(0,ss.y,ss.z+ss.x,ss.step+1)); done[0][ss.y][ss.z+ss.x]=true; }
        }
        //c->a
        int f4=ss.z-a+ss.x;
        if(f4>=0) {
                if(!done[a][ss.y][f4]) { pq.push(state(a,ss.y,f4,ss.step+1)); done[a][ss.y][f4]=true; }
        }
        else {
                if(!done[ss.x+ss.z][ss.y][0]) { pq.push(state(ss.x+ss.z,ss.y,0,ss.step+1)); done[ss.x+ss.z][ss.y][0]=true; }
        }
        //b->c
        int f5=ss.y-c+ss.z;
        if(f5>=0) {
                if(!done[ss.x][f5][c]) { pq.push(state(ss.x,f5,c,ss.step+1)); done[ss.x][f5][c]=true; }
        }
        else {
                if(!done[ss.x][0][ss.z+ss.y]) { pq.push(state(ss.x,0,ss.z+ss.y,ss.step+1)); done[ss.x][0][ss.z+ss.y]=true; }
        }
        //c->b
        int f6=ss.z-b+ss.y;
        if(f6>=0) {
                if(!done[ss.x][b][f6]) { pq.push(state(ss.x,b,f6,ss.step+1)); done[ss.x][b][f6]=true; }
        }
        else {
                if(!done[ss.x][ss.y+ss.z][0]) { pq.push(state(ss.x,ss.y+ss.z,0,ss.step+1)); done[ss.x][ss.y+ss.z][0]=true; }
        }
    }
    return -1;
}
int main()
{
    while(scanf("%d%d%d",&a,&b,&c)==3)
    {
        if(!a&&!b&&!c) break;
        int f=bfs();
        if(f<0) printf("NO\n");
        else printf("%d\n",f);
    }
    return 0;
}