zoj 3913 Bob wants to pour water

zoj 3913 Bob wants to pour water,第1张

zoj 3913 Bob wants to pour water
#include<stdio.h>#include<string.h>#include<math.h>#define PI acos(-1.0)#define eps 0.0000000001struct node{  double z,a,b,c;}p[100005];struct node1{ double z,r;}q[100005];double w,len,v;int n,m;double cal(double x){    int i,j;    double ans=0;    for(i=1;i<=m;i++)    {        if(x>=p[i].z+p[i].c/2.0)ans=ans+p[i].a*p[i].b*p[i].c;        else if(x<=p[i].z-p[i].c/2.0)ans=ans+0;        else ans=ans+p[i].a*p[i].b*(x-(p[i].z-p[i].c/2.0));    }    for(i=1;i<=n;i++)    {        if(x>=q[i].z+q[i].r)ans=ans+4.0/3*PI*q[i].r*q[i].r*q[i].r;        else if(x<=q[i].z-q[i].r)ans=ans+0;        else if(x>q[i].z-q[i].r&&x<q[i].z)ans=ans+PI*(q[i].r+x-q[i].z)*(q[i].r+x-q[i].z)*(q[i].r-(q[i].r+x-q[i].z)/3.0);        else ans=ans+4.0/3*PI*q[i].r*q[i].r*q[i].r-PI*(q[i].r+q[i].z-x)*(q[i].r+q[i].z-x)*(q[i].r-(q[i].r+q[i].z-x)/3.0);    }    return ans;}double erfen(double l,double r){    double mid,mianji;    while(fabs(l-r)>eps)    {        mid=(l+r)/2.0;        double x=cal(mid);        mianji=w*len*mid-x;        if(fabs(mianji-v)<=eps)return mid;        else if(mianji<v)l=mid;        else if(mianji>v)r=mid;    }    return mid;}int main(){    int T,i,j,k;    scanf("%d",&T);    while(T--)    {        scanf("%lf%lf%lf%d%d",&w,&len,&v,&m,&n);        for(i=1;i<=m;i++) scanf("%lf%lf%lf%lf",&p[i].z,&p[i].a,&p[i].b,&p[i].c);        for(i=1;i<=n;i++) scanf("%lf%lf",&q[i].z,&q[i].r);        double ans=erfen(0,10000000000005);        printf("%.8fn",ans);    }    return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址: http://outofmemory.cn/zaji/4914739.html

(0)
打赏 微信扫一扫 微信扫一扫 支付宝扫一扫 支付宝扫一扫
上一篇 2022-11-12
下一篇 2022-11-12

发表评论

登录后才能评论

评论列表(0条)

保存