HDU - 1495 非常可乐(倒水问题BFS)

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 
    
    

题解：先设计M<N<S，就只有6个方向

S -> N, S->M, N->M,M->N,M->S,N->S;

利用这六个方向衍生出去，一直判断到N和S杯相等与N == S/2，否者就不能分均

<pre name="code" class="cpp">#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int MAXN = 101;
int S,N,M;
bool vis[MAXN][MAXN];
struct node{
    int x,y,all,step;
};
//M<N<S
void BFS(){
    queue<node> Q;
    node temp1,temp2;
    temp1.x = 0,temp1.y = 0,temp1.all = S,temp1.step = 0;
    Q.push(temp1);
    vis[temp1.x][temp1.y] = true;
    while(!Q.empty()){
        temp1 = Q.front();Q.pop();
        if(temp1.y == S/2 && temp1.y == temp1.all){
            printf("%d\n",temp1.step);return;
        }
        //S->M
        if(temp1.all + temp1.x > M){
            temp2.x = M, temp2.all=temp1.all+temp1.x-M;
            temp2.y = temp1.y,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }else{
            temp2.x = temp1.all+temp1.x,temp2.y = temp1.y;
            temp2.all = 0,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }
        //S->N
        if(temp1.all + temp1.y > N){
            temp2.x = temp1.x, temp2.all = temp1.all+temp1.y-N;
            temp2.y = N, temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }else{
            temp2.x = temp1.x, temp2.all = 0;
            temp2.y = temp1.all+temp1.y,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }
        //M->N
        if(temp1.x+temp1.y > N){
            temp2.all = temp1.all,temp2.y = N;
            temp2.x = temp1.x+temp1.y-N,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }else{
            temp2.all = temp1.all,temp2.y = temp1.x+temp1.y;
            temp2.x = 0,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }
        //N->M
        if(temp1.x+temp1.y > M){
            temp2.all = temp1.all,temp2.x = M;
            temp2.y = temp1.y+temp1.x-M,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }else{
            temp2.all = temp1.all,temp2.x = temp1.x+temp1.y;
            temp2.y = 0,temp2.step = temp1.step+1;
            if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        }
        //N->S
        temp2.all = temp1.y+temp1.all,temp2.x = temp1.x;
        temp2.y = 0,temp2.step = temp1.step + 1;
        if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
        //M->S
        temp2.all = temp1.x+temp1.all,temp2.y = temp1.y;
        temp2.x = 0,temp2.step = temp1.step + 1;
        if(!vis[temp2.x][temp2.y]){Q.push(temp2);vis[temp2.x][temp2.y] = true;}
    }
    printf("NO\n");
}

int main(){
    while(scanf("%d%d%d",&S,&N,&M)==3 && S&&N&&M){
        memset(vis,false,sizeof(vis));
        if(S%2)printf("NO\n");
        else{if(M > N)swap(M,N);BFS();}
    }
    return 0;
}