USACO 3.3.2

 

背包问题，或者说 DAG上的动态规划，固定终点的最短路问题 .(参见lrj《算法竞赛入门经典》)

题目有点像硬币问题，可以直接用dp解决.
[方程]
f[a1][a2][a3][a4][a5] = min{f[a1-p[i][1][a2-p[i][2][a3-p[i][3][a4-p[i][4]][a5-p[i][5]+p[i][0]}
（0<i<=s, ak-p[i][k]>=0,p[i][0]是优惠后的价格）

[状态设置]
f[a1][a2][a3][a4][a5]为买a1件物品1,a2件物品2,a3件物品3,a4件物品4,a5件物品5时，所需的最少价格

[边界条件] f[0][0][0][0][0]=0;

USACO官方解法很有启发性，用最短路，把每种状态[a1][a2][a3][a4][a5]（a1件物品1,a2件物品2,a3件物品3,a4件物品4,a5件物品5）看成一个点，则至多7776个点，而每个优惠就是一条边，则至多105条边。 接下来就是求[0,0,0,0,0]到目标状态的最短路，用Dijkstra(Heap优化)即可.


Executing...
   Test 1: TEST OK [0.011 secs, 3408 KB]
   Test 2: TEST OK [0.000 secs, 3408 KB]
   Test 3: TEST OK [0.000 secs, 3408 KB]
   Test 4: TEST OK [0.011 secs, 3408 KB]
   Test 5: TEST OK [0.000 secs, 3408 KB]
   Test 6: TEST OK [0.000 secs, 3408 KB]
   Test 7: TEST OK [0.000 secs, 3408 KB]
   Test 8: TEST OK [0.000 secs, 3408 KB]
   Test 9: TEST OK [0.000 secs, 3408 KB]
   Test 10: TEST OK [0.022 secs, 3408 KB]
   Test 11: TEST OK [0.022 secs, 3408 KB]
   Test 12: TEST OK [0.011 secs, 3408 KB]

All tests OK.

Your program ('shopping') produced all correct answers! This is your submission #2 for this problem. Congratulations!

 

[Code]

#include<stdio.h> #include<limits.h> int p[110][10] = {0}, aim[10], f[10][10][10][10][10] = {0}, co[10] = {0}, v[10], t = 1, s; int find(int c)//商品编号转换 { bool flag = 1; for (int i = 1; i <= t; i++)//添加新编号 if(v[i] == c){flag = 0; break;} if(flag) v[t++] = c; for (int i = 1; i < 6; i++) if (v[i] == c) {return i; break;} return 0; } int min(int x, int y){return (x < y) ? x : y;} int main() { FILE *fin, *fout; fin = fopen("shopping.in", "r"); fout = fopen("shopping.out", "w"); int i, j, n, c, k, b; fscanf(fin, "%d", &s);//读入优惠 for (i = 0; i < s; i++) { fscanf(fin, "%d", &n); for (j = 1; j <= n; j++) { fscanf(fin, "%d %d", &c, &k); p[i][find(c)] = k; } fscanf(fin, "%d", &p[i][0]); } fscanf(fin, "%d", &b);//读入需购买商品 for (i = 0; i < b; i++) { fscanf(fin, "%d %d", &c, &k); aim[find(c)] = k; fscanf(fin, "%d", &co[find(c)]); } int i1, i2, i3, i4, i5; for (i1 = 0; i1 <= aim[1]; i1++)//dp for (i2 = 0; i2 <= aim[2]; i2++) for (i3 = 0; i3 <= aim[3]; i3++) for (i4 = 0; i4 <= aim[4]; i4++) for (i5 = 0; i5 <= aim[5]; i5++) { f[i1][i2][i3][i4][i5] = i1*co[1] + i2*co[2] + i3*co[3] + i4*co[4] + i5*co[5]; //没有优惠的情况 for (i = 0; i < s; i++) if(i1-p[i][1]>=0&&i2-p[i][2]>=0&&i3-p[i][3]>=0&&i4-p[i][4]>=0&&i5-p[i][5]>=0) //避免负数 f[i1][i2][i3][i4][i5] = min(f[i1][i2][i3][i4][i5], f[i1-p[i][1]][i2-p[i][2]][i3-p[i][3]][i4-p[i][4]][i5-p[i][5]]+p[i][0]); } fprintf(fout, "%d/n", f[aim[1]][aim[2]][aim[3]][aim[4]][aim[5]]); }