三个容器的倒水问题

/*问：有三个容器，容量是x、y、z，若要得到t体积的水，倒来倒去最少需要操作几步？*/
/*测试用例：输入3 5 8 4，输出6*/

#include <iostream>
#include <array>
#include <vector>
#include <queue>

using namespace std;

//一个存储三个容器当前状态的结构体，同时记录步数
struct VolumeState {
    array<int, 4> V{};
    int Step;
    VolumeState() {
        V = {0, 0, 0, 0};
        Step = 0;
    }
};

// 由第i个容器向第j个容器倒水，需要将第j个容器装满才可
void Pour(int i, int j, VolumeState &s, const array<int, 4> &Volume) {
    int Sum = s.V[i] + s.V[j];
    //第i个容器部分倒出
    if(Sum > Volume[j]) {
        s.V[i] = Sum - Volume[j];
        s.V[j] = Volume[j];
    }
    //第i个容器全部倒出
    else {
        s.V[i] = 0;
        s.V[j] = Sum;
    }
}

int BFS(VolumeState start, int t, const array<int, 4> &Volume, vector<vector<vector<bool>>> &Visited) {
    queue<VolumeState> Queue;
    Queue.push(start);
    while (!Queue.empty()) {
        VolumeState state = Queue.front();
        Queue.pop();
        Visited[state.V[1]][state.V[2]][state.V[3]] = 1;
        //遍历这一步所有可能的倒水操作
        for (int i = 1; i <= 3; ++i) {
            if (state.V[i] == 0)
                continue;
            for (int j = 1; j <= 3; ++j) {
                if (i != j) {
                    VolumeState temp = state;
                    Pour(i, j, temp, Volume);
                    temp.Step++;
                    if(temp.V[1] == t || temp.V[2] == t || temp.V[3] == t)
                        return temp.Step; //广度优先搜索首先得到的一定是最小的步数
                    if(!Visited[temp.V[1]][temp.V[2]][temp.V[3]])
                        Queue.push(temp);
                }
            }
        }
    }
    return INT_MAX;
}

int main() {
    int x, y, z, t;
    cin >> x >> y >> z >> t;
    array<int, 4> Volume{0, x, y, z};
    //需要有个表记录已经遍历过的情况，防止BFS死循环
    vector<vector<vector<bool>>> Visited(x + 1, vector<vector<bool>>(y + 1, vector<bool>(z + 1, 0)));
    if (t == x || t == y || t == z) {
        cout << 0 << endl;
        return 0;
    }
    int MinStep = INT_MAX;
    //遍历所有可能的初始情况
    for (int i = 1; i <= 3; ++i) {
        VolumeState start;
        start.V[i] = Volume[i];
        MinStep = min(MinStep, BFS(start, t, Volume, Visited));
        for (int j = 1; j <= 3; ++j) {
            if (i != j) {
                start.V[j] = Volume[j];
                MinStep = min(MinStep, BFS(start, t, Volume, Visited));
            }
        }
    }
    if (MinStep == INT_MAX)
        cout << -1 << endl;
    else
        cout << MinStep << endl;
    return 0;
}