UVa10603 Fill （隐式图搜索+Dijkstra）

 1 #include <cstdio>
 2 #include <queue>
 3 #include <algorithm>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 struct Node {
 8     int v[3], dist;
 9     bool operator < (const Node& rhs) const {
10         return dist > rhs.dist;
11     }
12 };
13 
14 int const maxn = 200 + 5;
15 int a, b, c, d, cap[3], vis[maxn][maxn], ans[maxn];
16 
17 void update_ans(const Node& u) {
18     for (int i = 0; i < 3; i++) {
19         int d = u.v[i];
20         if (ans[d] < 0 || u.dist < ans[d]) ans[d] = u.dist;
21     }
22 }
23 
24 void solve() {
25     cap[0] = a; cap[1] = b; cap[2] = c;
26     memset(vis, 0, sizeof(vis));
27     memset(ans, -1, sizeof(ans));
28     priority_queue<Node> q;
29 
30     Node start;
31     start.dist = 0;
32     start.v[0] = 0; start.v[1] = 0; start.v[2] = c;
33     vis[0][0] = 1;
34     q.push(start);
35 
36     while (!q.empty()) {
37         Node u = q.top(); q.pop();
38         update_ans(u);
39         if (ans[d] >= 0) break;
40         for (int i = 0; i < 3; i++)
41             for (int j = 0; j < 3; j++) if (i != j) {
42                 if (u.v[i] == 0 || u.v[j] == cap[j]) continue;
43                 int amount = min(cap[j], u.v[i] + u.v[j]) - u.v[j];
44                 Node u2;
45                 memcpy(&u2, &u, sizeof(u));
46                 u2.dist = u.dist + amount;
47                 u2.v[i] -= amount;
48                 u2.v[j] += amount;
49                 if (!vis[u2.v[0]][u2.v[1]]) {
50                     vis[u2.v[0]][u2.v[1]] = 1;
51                     q.push(u2);
52                 }
53             }
54     }
55     while (d >= 0) {
56         if (ans[d] >= 0) {
57             printf("%d %d\n", ans[d], d);
58             return;
59         }
60         d--;
61     }
62 }
63 
64 int main() {
65     int T;
66     scanf("%d", &T);
67     while (T--) {
68         scanf("%d%d%d%d", &a, &b, &c, &d);
69         solve();
70     }
71     return 0;
72 }