NYOJ-21三个水杯（BFS 广度优先搜索）

三个水杯

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 4

描述

给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。

输入

第一行一个整数N(0<N<50)表示N组测试数据
接下来每组测试数据有两行，第一行给出三个整数V1 V2 V3 (V1>V2>V3 V1<100 V3>0)表示三个水杯的体积。
第二行给出三个整数E1 E2 E3 （体积小于等于相应水杯体积）表示我们需要的最终状态

输出

每行输出相应测试数据最少的倒水次数。如果达不到目标状态输出-1

样例输入

2
6 3 1
4 1 1
9 3 2
7 1 1

样例输出

3
-1

典型的BFS(广度优先搜索）

每次倒水 有6种情况：

水杯A、B、C

A－>B

A -->C

B-->A

B-->C

C-->A

C-->B

按BFS思想构造 求目标的 深度即最少倒水次数

//
//  main.cpp
//  NYOJ-21 三个水杯
//  BFS  广度优先搜索
//  Created by H@L on 14-7－22.
//  Copyright (c) 2014年 Hzw. All rights reserved.
//


#include<iostream>
#include <queue>
#include <vector>
#include "string.h"
#include <algorithm>


using namespace std;
int cupCapacity[3],targetState[3];

class CupState
{
public:
    int iState[3];
    int iStep;
};


bool operator== ( const CupState  &data1, const CupState &data2)
{
    if( data1.iState[0]== data2.iState[0]
       && data1.iState[1] == data2.iState[1]
       && data1.iState[2] == data2.iState[2])
        return true;
    else
        return  false;
}

vector<CupState> visitBuf;

int pourWater(int sourceId,int targetId,CupState WaterState,queue<CupState> &qCupState)
{
    if(WaterState.iState[0] == targetState[0]
       && WaterState.iState[1] == targetState[1]
       && WaterState.iState[2] == targetState[2])
        return WaterState.iStep;
    
    if (sourceId == targetId ||
        WaterState.iState[sourceId] == 0
        || WaterState.iState[targetId] == cupCapacity[targetId]) {
        return -1;
    }
    if (cupCapacity[targetId] - WaterState.iState[targetId] >= WaterState.iState[sourceId]) {
        WaterState.iState[targetId] += WaterState.iState[sourceId];
        WaterState.iState[sourceId] = 0;
    }
    else
    {
        WaterState.iState[sourceId] -= (cupCapacity[targetId] - WaterState.iState[targetId]);
        WaterState.iState[targetId] = cupCapacity[targetId];
    }
    WaterState.iStep++;
    if(WaterState.iState[0] == targetState[0]
       && WaterState.iState[1] == targetState[1]
       && WaterState.iState[2] == targetState[2])
        return WaterState.iStep;
    if(find(visitBuf.begin(), visitBuf.end(), WaterState) ==visitBuf.end())
    {
        qCupState.push(WaterState);
        visitBuf.push_back(WaterState);
    }
    return -1;
}

int fBFS()
{
    CupState beginState, stateTemp;
    memset(&beginState, 0, sizeof(beginState));
    memset(&stateTemp, 0, sizeof(stateTemp));
    beginState.iState[0] = cupCapacity[0];
    queue<CupState> qCupState;
    qCupState.push(beginState);
    visitBuf.push_back(beginState);
    while (!qCupState.empty()) {
        CupState data = qCupState.front();
        qCupState.pop();
        for(int i=0;i<3;i++)
            for(int j=0;j<3;j++)
            {
                int iRet = pourWater(i, j, data,qCupState);
                if (iRet != -1) {
                    return iRet;
                }
            }
    }
    return -1;
};

int main()
{
    int M;
	cin>>M;
    while (M--) {
        visitBuf.clear();
        cin >> cupCapacity[0] >> cupCapacity[1] >> cupCapacity[2];
        cin >> targetState[0] >> targetState[1] >> targetState[2];
        cout << fBFS() << endl;
    }
    return 0;
}