USACO 2.1 Healthy Holsteins (DFS)

#include <stdio.h>
#define DEBUG 1
#define TESTCASES 9
#define MAX_TYPES_VITAMINS 25
#define MAX_TYPES_FEEDS 15
int typesOfVitamins;
int minRequare[MAX_TYPES_VITAMINS + 1];
int typesOfFeeds;
int vitaminOfFeed[MAX_TYPES_FEEDS + 1][MAX_TYPES_VITAMINS + 1];
int currentVitamin[MAX_TYPES_VITAMINS + 1];
int stack[MAX_TYPES_FEEDS + 1];
int top;
int feedsEatten[MAX_TYPES_FEEDS + 1];
int minTypesOfFeedsEatten;

int enough(){
	int vitamin;
	for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
		if (currentVitamin[vitamin] < minRequare[vitamin])
			return 0;
	return 1;
}

void eat(int feed){
	if (top >= minTypesOfFeedsEatten)
		return;
	if (enough()){
		minTypesOfFeedsEatten = top;
		int i;
		for (i = 1; i <= top; i++)
			feedsEatten[i] = stack[i];
		return;
	}
	if (feed > typesOfFeeds)
		return;
	int vitamin;
	for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
		currentVitamin[vitamin] += vitaminOfFeed[feed][vitamin];
	stack[++top] = feed;
	eat(feed + 1);
	for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
		currentVitamin[vitamin] -= vitaminOfFeed[feed][vitamin];
	top--;
	eat(feed + 1);
}

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[20] = "inputx.txt";
		inputFileName[5] = '1' +  (testCase - 1);
		freopen(inputFileName, "r", stdin);
		printf("\n#%d\n", testCase);
#endif

	scanf("%d", &typesOfVitamins);
	int vitamin;
	for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
		scanf("%d", &minRequare[vitamin]);

	scanf("%d", &typesOfFeeds);
	int feed;
	for (feed = 1; feed <= typesOfFeeds; feed++)
		for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
			scanf("%d", &vitaminOfFeed[feed][vitamin]);

	for (vitamin = 1; vitamin <= typesOfVitamins; vitamin++)
		currentVitamin[vitamin] = 0;
	top = 0;
	minTypesOfFeedsEatten = MAX_TYPES_FEEDS + 1;

	eat(1);

	printf("%d ", minTypesOfFeedsEatten);
	int i;
	for (i = 1; i <= minTypesOfFeedsEatten; i++)
		printf("%d ", feedsEatten[i]);
	printf("\n");

#if DEBUG
	}
#endif
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值