【搜索】【USACO】Healthy Holsteins

Farmer John prides himself on having the healthiest dairy cows in the world. He knows the vitamin content for one scoop of each feed type and the minimum daily vitamin requirement for the cows. Help Farmer John feed his cows so they stay healthy while minimizing the number of scoops that a cow is fed.

Given the daily requirements of each kind of vitamin that a cow needs, identify the smallest combination of scoops of feed a cow can be fed in order to meet at least the minimum vitamin requirements.

Vitamins are measured in integer units. Cows can be fed at most one scoop of any feed type. It is guaranteed that a solution exists for all contest input data.

PROGRAM NAME: holstein

INPUT FORMAT

Line 1:	integer V (1 <= V <= 25), the number of types of vitamins
Line 2:	V integers (1 <= each one <= 1000), the minimum requirement for each of the V vitamins that a cow requires each day
Line 3:	integer G (1 <= G <= 15), the number of types of feeds available
Lines 4..G+3:	V integers (0 <= each one <= 1000), the amount of each vitamin that one scoop of this feed contains. The first line of these G lines describes feed #1; the second line describes feed #2; and so on.

SAMPLE INPUT (file holstein.in)

4
100 200 300 400
3
50   50  50  50
200 300 200 300
900 150 389 399

OUTPUT FORMAT

The output is a single line of output that contains:

• the minimum number of scoops a cow must eat, followed by:
• a SORTED list (from smallest to largest) of the feed types the cow is given

If more than one set of feedtypes yield a minimum of scoops, choose the set with the smallest feedtype numbers.

SAMPLE OUTPUT (file holstein.out)

2 1 3

 
 

描述

农民JOHN以拥有世界上最健康的奶牛为骄傲。他知道每种饲料中所包含的牛所需的最低的维他命量是多少。请你帮助农夫喂养他的牛，以保持它们的健康，使喂给牛的饲料的种数最少。

给出牛所需的最低的维他命量，输出喂给牛需要哪些种类的饲料，且所需的饲料剂量最少。

维他命量以整数表示，每种饲料最多只能对牛使用一次，数据保证存在解。

格式

PROGRAM NAME: holstein

INPUT FORMAT:

(file holstein.in)

第1行：一个整数V(1<=V<=25)，表示需要的维他命的种类数。

第2行：V个整数(1<=每个数<=1000)，表示牛每天需要的维他命的最小量。

第3行：一个整数G(1<=G<=15)，表示可用来喂牛的饲料的种数。

下面G行，第i行表示编号为i饲料包含的各种维他命的量的多少。

OUTPUT FORMAT:

(file holstein.out)

输出文件只有一行，包括

牛必需的最小的饲料种数P

后面有P个数，表示所选择的饲料编号（按从小到大排列）。

如果有多个解，输出饲料序号最小的（即字典序最小）。

 SAMPLE INPUT

4
100 200 300 400
3
50 50 50 50
200 300 200 300
900 150 389 399

 SAMPLE OUTPUT

2 1 3

 
 

dfs即可

 

/* ID:sephiro5 LANG:C++ PROG:holstein */ #include<stdio.h> int now[30],tog[30]; int v,g; int a[30][30],ans[30],teans[30],min=99999999; bool check(){ for (int i=1;i<=v;++i) if (now[i]<tog[i]) return false; return true; } void find(int x,int sum){ if (x>g) return; for (int i=1;i<=v;++i) now[i]+=a[x][i]; teans[sum+1]=x; if (check()) if (sum+1<min){ min=sum+1; for (int i=1;i<=v;++i) ans[i]=teans[i]; } else {} else find(x+1,sum+1); for (int i=1;i<=v;++i) now[i]-=a[x][i]; find(x+1,sum); } int main(){ freopen("holstein.in","r",stdin); freopen("holstein.out","w",stdout); scanf("%d",&v); for (int i=1;i<=v;++i) scanf("%d",&tog[i]); scanf("%d",&g); for (int i=1;i<=g;++i) for (int j=1;j<=v;++j) scanf("%d",&a[i][j]); find(1,0); printf("%d ",min); for (int i=1;i<min;++i) printf("%d ",ans[i]); printf("%d/n",ans[min]); return 0; }