Fill
UVA 10603
- 要求倒水量最小,所以在Node中定义w表示当前状态的倒水量,然后在插入节点时用优先队列排序
- 如何解决找不到d升水时的情况?可以用record[i]来表示至少有一个杯子为i升水时的最少倒水量,这样找不到d时,就从d向左找第一个有记录的点即可
- 这是一道倒水问题的衍生题目,主要是多了优先队列
#include <iostream>
#include<queue>
#include<cstring>
using namespace std;
struct Node {
int w;
int cap[3];
Node(int x = 0, int y = 0, int z = 0, int q = 0) {
cap[0] = x, cap[1] = y, cap[2] = z, w = q;
}
friend bool operator<(Node a, Node b) {
return a.w > b.w;
}
};
int a, b, c, d;
int vis[205][205];
int record[205];
int capacity[3];
bool judge(int i, int j, Node u) {
if ((u.cap[i] != 0) && (u.cap[j] != capacity[j]) && (i != j)) return true;
return false;
}
void bfs() {
capacity[0] = a, capacity[1] = b, capacity[2] = c;
memset(vis, -1, sizeof(vis));
memset(record, -1, sizeof(record));
priority_queue<Node> que;
que.push(Node(0, 0, c, 0));
record[c] = 0, record[0] = 0;
vis[0][c] = 1;
while (!que.empty()) {
Node u = que.top();
que.pop();
if (record[d] != -1) {
break;
}
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++) {
if (judge(i, j, u)) {
int temp = min(u.cap[i], capacity[j] - u.cap[j]);
Node u2;
memcpy(&u2, &u, sizeof(u));
u2.cap[i] -= temp, u2.cap[j] += temp, u2.w += temp;
if (vis[u2.cap[1]][u2.cap[2]] == -1) {
que.push(u2);
vis[u2.cap[1]][u2.cap[2]] = 1;
if (record[u2.cap[i]] == -1) record[u2.cap[i]] = u2.w;
if (record[u2.cap[j]] == -1) record[u2.cap[j]] = u2.w;
}
}
}
}
if (record[d] == -1) {
for (int i = d - 1; i >= 0; i--) {
if (record[i] != -1) {
d = i;
break;
}
}
}
cout << record[d] << " " << d << endl;
}
int main()
{
int t;
cin >> t;
while (t--) {
cin >> a >> b >> c >> d;
bfs();
}
return 0;
}
倒水问题
#include <iostream>
#include<queue>
using namespace std;
struct Node {
int cap[3];
int step;
Node(int x = 0, int y = 0, int z = 0, int d = 0) {
cap[0] = x, cap[1] = y, cap[2] = z, step = d;
}
};
int record[1005];
int vis[1005][1005];
int arr[3];
int a, b, c, x;
bool judge(int i, int j, Node u) {
if ((u.cap[i] != 0) && (u.cap[j] != arr[j]) && (i != j)) return true;
return false;
}
void bfs() {
arr[0] = a, arr[1] = b, arr[2] = c;
memset(record, -1, sizeof(record));
memset(vis, -1, sizeof(vis));
queue<Node> que;
que.push(Node(a, 0, 0, 0));
vis[0][0] = 1;
record[a] = 0, record[0] = 0;
while (!que.empty()) {
Node u = que.front();
que.pop();
if (record[x] != -1) break;
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++) {
if (judge(i, j, u)) {
int temp = min(u.cap[i], arr[j] - u.cap[j]);
Node u2;
memcpy(&u2, &u, sizeof(u));
u2.cap[i] -= temp, u2.cap[j] += temp, u2.step += 1;
if (vis[u2.cap[1]][u2.cap[2]] == -1) {
que.push(u2);
if (record[u2.cap[i]] == -1) record[u2.cap[i]] = u.step + 1;
if (record[u2.cap[j]] == -1) record[u2.cap[j]] = u.step + 1;
vis[u2.cap[1]][u2.cap[2]] = 1;
}
}
}
}
if (record[x] != -1) cout << record[x] << endl;
else cout << "NO" << endl;
}
int main()
{
while (cin >> a >> b >> c >> x) {
bfs();
}
return 0;
}