Uva10603——Fill

求的是倒水量最小，不是次数。

代码：

#include <iostream>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;

struct Node
{
	int v[3], dist;
	bool operator < (const Node& a)const
	{
		return dist > a.dist;
	}
};

const int maxn = 210;
int vis[maxn][maxn], cap[3], ans[maxn];

void update_ans(const Node& n)
{
	for(int i = 0; i < 3; i++)
	{
		int d = n.v[i];
		if(ans[d] < 0 || n.dist < ans[d])
			ans[d] = n.dist;
	}
}
void solve(int a, int b, int c, int d)
{
	cap[0] = a, cap[1] = b, cap[2] = c;
	memset(vis, 0, sizeof(vis));
	memset(ans, -1, sizeof(ans));
	priority_queue<Node> q;

	Node start;
	start.dist = 0;
	start.v[0] = 0, start.v[1] = 0, start.v[2] = c;
	q.push(start);

	vis[0][0] = 1;
	while(!q.empty())
	{
		Node u = q.top();
		q.pop();
		update_ans(u);

		if(ans[d] >= 0)
			break;

		for(int i = 0; i < 3; i++)
			for(int j = 0; j < 3; j++)
			{
				if(u.v[i] == 0 || u.v[j] == cap[j])
					continue;
				int amount = cap[j] > u.v[i] + u.v[j] ? u.v[i] + u.v[j] - u.v[j] : cap[j] - u.v[j];
				Node u2;
				memcpy(&u2, &u, sizeof(u));
				u2.dist = u.dist + amount;
				u2.v[i] -= amount;
				u2.v[j] += amount;
				if(!vis[u2.v[0]][u2.v[1]])
				{
					vis[u2.v[0]][u2.v[1]] = 1;
					q.push(u2);
				}
			}
	}
	while(d >=0)
	{
		if(ans[d] >= 0)
		{
			cout << ans[d] << ' ' << d << endl;
			return;
		}
		d--;
	}
}

int main()
{
	int t, a, b, c, d;
	cin >> t;
	while(t--)
	{
		cin >> a >> b >> c >> d;
		solve(a, b, c, d);
	}
	return 0;
}