简单的二分,先判断给的水是否超过所有的盒子的容量,然后对最高的盒子的上界和最低的盒子的下界进行二分,直到h-l满足给定的条件跳出,只需要再加一个中间状态算总的水的体积的函数即可,代码如下:
include<stdio.h>
double eps=0.000001;
int v,hmax,hmin;
int n;
struct box{
int b,h,w,d;
}c[51000];
double vol(double hight,box x) //求高度为hight时,某个box所有的水的体积
{
if(x.b>=hight)
return 0;
if(hight>x.b+x.h)
return (double)x.d*x.w*x.h;
else
return ((double)(hight-x.b))*x.w*x.d;
}
double vv(double hight) //求高度为hight时,所有的盒子里面的水的总体积
{
int i;
double vi=0;
for(i=0;i<n;i++)
{
if (c[i].b > hight)continue;
else if (c[i].b + c[i].h < hight) vi += c[i].h * c[i].w * c[i].d;
else vi += (double)(hight - c[i].b) * c[i].w * c[i].d;
}
//printf("%lf %lf\n",vi,hight);
return vi;
}
int main()
{
int t,i;
scanf("%d",&t);
while(t--)
{
hmax=0,hmin= 0x3fffffff;
scanf("%d",&n);
int vmax=0;
for(i=0;i<n;i++)
{
scanf("%d %d %d %d",&c[i].b,&c[i].h,&c[i].w,&c[i].d);
if(c[i].b<hmin)
hmin=c[i].b;
if(c[i].b+c[i].h>hmax)
hmax=c[i].b+c[i].h;
vmax+=c[i].d*c[i].h*c[i].w;
}
scanf("%d",&v);
if(v>vmax) //判断总体积是否超过最大体积
printf("OVERFLOW\n");
else if(v==vmax)
printf("%.2lf\n",(double)hmax);
else
{
double hmed;
double h=hmax,l=hmin;
//printf("%lf %lf\n",h,l);
while(h-l>0.0001) //不断二分求解,设定置信区间
{
hmed=(h+l)/2;
//printf("%lf %lf\n",hmax,hmin);
if(vv(hmed)>=v)
h=hmed;
else
l=hmed;
}
printf("%.2lf\n",hmed);
}
}
return 0;
}