• • 23通过
  • 41提交
• 题目提供者该用户不存在
• 标签USACO
• 难度提高+/省选-

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>using namespace std;int s,b,vis1[10000],need[100],neednum[10000],needmoney[10000],ans = 10000000,vis[6][6][6][6][6],hashh[3000000],tot;struct node
{int num[10000];int money;
}a[110];void dfs(int m,int n)
{int flag = 0;for (int i = 1; i <= n; i++){//printf("%d\n", neednum[need[i]]);if (neednum[need[i]] != 0){flag = 1;break;}}if (flag == 0)if (ans > m){ans = m;return;}if (hashh[vis[neednum[need[1]]][neednum[need[2]]][neednum[need[3]]][neednum[need[4]]][neednum[need[5]]]] != 0 && hashh[vis[neednum[need[1]]][neednum[need[2]]][neednum[need[3]]][neednum[need[4]]][neednum[need[5]]]] == m)return;vis[neednum[need[1]]][neednum[need[2]]][neednum[need[3]]][neednum[need[4]]][neednum[need[5]]] = ++tot;hashh[vis[neednum[need[1]]][neednum[need[2]]][neednum[need[3]]][neednum[need[4]]][neednum[need[5]]]] = m;for (int i = 1; i <= s; i++){int flag1 = 0;for (int j = 1; j <= n; j++)if (neednum[need[j]] < a[i].num[need[j]]){flag1 = 1;break;}if (flag1 == 0){//printf("%d\n", i);for (int j = 1; j <= n; j++)neednum[need[j]] -= a[i].num[need[j]];dfs(m + a[i].money, n);for (int j = 1; j <= n; j++)neednum[need[j]] += a[i].num[need[j]];}}for (int i = 1; i <= n; i++)if (neednum[need[i]] >= 1){neednum[need[i]]--;dfs(m + needmoney[need[i]], n);neednum[need[i]]++;}return;
}int main()
{scanf("%d", &s);for (int i = s; i >= 1; i--){int n,t = 0,p;scanf("%d", &n);for (int j = 1; j <= n; j++){int k, c;scanf("%d%d", &c, &k);a[i].num[c] = k;}scanf("%d", &p);a[i].money = p;}scanf("%d", &b);int t = 0;for (int i = 1; i <= b; i++){int c, k, p;scanf("%d%d%d", &c, &k, &p);if (!vis1[c]){vis1[c] = 1;need[++t] = c;}neednum[c] = k;needmoney[c] = p;}/*for (int i = 1; i <= s; i++){for (int j = 1; j <= t; j++)printf("%d需要%d\n", need[j], a[i].num[need[j]]);printf("钱%d\n", a[i].money);}for (int i = 1; i <= t; i++)printf("%d %d %d\n", need[i], neednum[need[i]], needmoney[need[i]]);*/dfs(0,t);printf("%d\n", ans);//while (1);return 0;
}

#include<cstdio>
#include<iostream>
#include<algorithm>
int n;
int i, j, k, l, m, z;
struct haha
{int n;int k[6];int p;
}a[200];
int nn;
int d[1000];
int t;
int ai, bi, ci;
int f[6][6][6][6][6];
int x[6];
using namespace std;
int main()
{scanf("%d", &n);for (i = 1;i <= n;i++){scanf("%d", &a[i].n);for (j = 1;j <= a[i].n;j++){scanf("%d%d", &ai, &bi);if (d[ai] == 0){t++;d[ai] = t;}a[i].k[d[ai]] = bi;}scanf("%d", &a[i].p); }scanf("%d", &nn);for (i = 1;i <= nn;i++){scanf("%d%d%d", &ai, &bi, &ci);if (d[ai] == 0){t++;d[ai] = t;}x[d[ai]] = bi;n++;a[n].n = 1;a[n].k[d[ai]] = 1;a[n].p = ci;}for (i = 0;i <= 5;i++)for (j = 0;j <= 5;j++)for (k = 0;k <= 5;k++)for (l = 0;l <= 5;l++)for (m = 0;m <= 5;m++)f[i][j][k][l][m] = 10000000;f[0][0][0][0][0] = 0; for (z = 1;z <= n;z++)for (i = a[z].k[1];i <= x[1];i++)for (j = a[z].k[2];j <= x[2];j++)for (k = a[z].k[3];k <= x[3];k++)for (l = a[z].k[4];l <= x[4];l++)for (m = a[z].k[5];m <= x[5];m++)f[i][j][k][l][m] = min(f[i][j][k][l][m],f[i - a[z].k[1]][j - a[z].k[2]][k - a[z].k[3]][l - a[z].k[4]][m - a[z].k[5]]+ a[z].p);printf("%d\n", f[x[1]][x[2]][x[3]][x[4]][x[5]]);return 0;
}