记录编号	604802	评测结果	AAAAAAAAAA
题目名称	3659.[SYOI 2022]倒水	最终得分	100
用户昵称	对立猫猫对立	是否通过	通过
代码语言	C++	运行时间	0.035 s
提交时间	2025-08-11 21:02:54	内存使用	4.77 MiB

#include <iostream>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
struct State {
    int cups[3];
    int steps;
};
int main() {
//    freopen("pourwater.in", "r", stdin);
//    freopen("pourwater.out", "w", stdout);
    int capacities[3], target;
    cin >> capacities[0] >> capacities[1] >> capacities[2] >> target;
    queue<State> q;
    bool visited[105][105][105] = {{{false}}};
    q.push({{capacities[0], 0, 0}, 0});
    visited[capacities[0]][0][0] = true;

    while (!q.empty()) {
        State current = q.front();
        q.pop();
        for (int amount : current.cups) {
            if (amount == target) {
                cout << current.steps;
                return 0;
            }
        }
        for (int from = 0; from < 3; from++) {
            for (int to = 0; to < 3; to++) {
                if (from == to) continue;

                State next = current;
                int pourAmount = min(next.cups[from], capacities[to] - next.cups[to]);
                
                next.cups[from] -= pourAmount;
                next.cups[to] += pourAmount;
                next.steps++;

                if (!visited[next.cups[0]][next.cups[1]][next.cups[2]]) {
                    visited[next.cups[0]][next.cups[1]][next.cups[2]] = true;
                    q.push(next);
                }
            }
        }
    }

    cout << "false";
    return 0;
}