洛谷 P3112 [USACO14DEC] 后卫马克Guard Mark

题目描述

Farmer John and his herd are playing frisbee. Bessie throws the

frisbee down the field, but it's going straight to Mark the field hand

on the other team! Mark has height H (1 <= H <= 1,000,000,000), but

there are N cows on Bessie's team gathered around Mark (2 <= N <= 20).

They can only catch the frisbee if they can stack up to be at least as

high as Mark. Each of the N cows has a height, weight, and strength.

A cow's strength indicates the maximum amount of total weight of the

cows that can be stacked above her.

Given these constraints, Bessie wants to know if it is possible for

her team to build a tall enough stack to catch the frisbee, and if so,

what is the maximum safety factor of such a stack. The safety factor

of a stack is the amount of weight that can be added to the top of the

stack without exceeding any cow's strength.

FJ将飞盘抛向身高为H(1 <= H <= 1,000,000,000)的Mark，但是Mark

被N(2 <= N <= 20)头牛包围。牛们可以叠成一个牛塔，如果叠好后的高度大于或者等于Mark的高度，那牛们将抢到飞盘。

每头牛都一个身高，体重和耐力值三个指标。耐力指的是一头牛最大能承受的叠在他上方的牛的重量和。请计算牛们是否能够抢到飞盘。若是可以，请计算牛塔的最大稳定强度，稳定强度是指，在每头牛的耐力都可以承受的前提下，还能够在牛塔最上方添加的最大重量。

输入输出格式

输入格式：

INPUT: (file guard.in)

The first line of input contains N and H.

The next N lines of input each describe a cow, giving its height,

weight, and strength. All are positive integers at most 1 billion.

输出格式：

OUTPUT: (file guard.out)

If Bessie's team can build a stack tall enough to catch the frisbee, please output the maximum achievable safety factor for such a stack.

Otherwise output "Mark is too tall" (without the quotes).

输入输出样例

输入样例#1：

4 10 
9 4 1 
3 3 5 
5 5 10 
4 4 5 

输出样例#1：

2 

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

状压DP~

大体上和乌龟的那道题是一样的，然而问题不一样……考试的时候写完才发现问的是能取到的情况下还能承受多少重量，程序又大换血……果然读题是很重要的啊2333

所以记录一下目前能达到的最高位置ans以及能达到地标的情况下的最大承受重量num。

再用numb[i]记录状态为i时（i为二进制数）的最大承受重量，预处理出hei[i]表示状态为i时的高度。

每次更新numb[i]时顺便判断现在的高度是否已经>=m，是的话更新num。

最后判断一下ans是否>=m，输出num或者“Mark is too tall”就可以了。

#include<cstdio>
#include<iostream>
using namespace std;

int n,m,kk[21],wei[1<<20],hei[1<<20],ans,numb[1<<20],num;
bool f[1<<20];

struct node{
	int h,w,s;
}a[21];

int read()
{
	int totnum=0;char ch=getchar();
	while(ch<'0' || ch>'9') ch=getchar();
	while(ch>='0' && ch<='9') {totnum=(totnum<<1)+(totnum<<3)+ch-'0';ch=getchar();}
	return totnum;
}

int main()
{
//	freopen("guardmark.in","r",stdin);
//	freopen("guardmark.out","w",stdout);
	n=read();m=read();kk[0]=1;num=1;
	for(int i=1;i<=20;i++) kk[i]=kk[i-1]<<1;
	for(int i=1;i<=n;i++)
	{
		a[i].h=read(),a[i].w=read(),a[i].s=read();
		f[kk[i-1]]=1;ans=max(ans,a[i].h);numb[kk[i-1]]=a[i].s;
		if(a[i].h>=m) num=max(num,numb[kk[i-1]]);
	}
	for(int k=1;k<kk[n];k++)
	  for(int i=1;i<=n;i++)
	    if(k&kk[i-1]) wei[k]+=a[i].w,hei[k]+=a[i].h;
	for(int k=1;k<kk[n];k++)
	  for(int i=1;i<=n;i++)
	    if(k&kk[i-1] && f[k^kk[i-1]] && wei[k^kk[i-1]]<=a[i].s)
	    {
			f[k]=1;
			ans=max(ans,hei[k]);
			numb[k]=max(numb[k],min(numb[k^kk[i-1]],a[i].s-wei[k^kk[i-1]]));
			if(hei[k]>=m) num=max(num,numb[k]);
	    }
	if(ans>=m) printf("%d\n",num);
	else printf("Mark is too tall\n");
	return 0;
}