UVA11722Joining with Friend概率dp

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
double t1,t2,s1,s2,w;
//取t为x轴,s为y轴
double geta(int b){//y=x+b,-90<=b<=90,取与四线的交点进行比较
    int y1=t1+b,y2=t2+b;
    if(y2<s1) return 0;
    if(y1<s1){
        if(y2<s2) return 0.5*(y2-s1)*(t2-(s1-b));
        else return 0.5*(s2-s1)*(t2-(s1-b)+t2-(s2-b));
    }
    if(y1<s2){
        if(y2<s2) return 0.5*(t2-t1)*(y1-s1+y2-s1);
        else return (t2-t1)*(s2-s1)-0.5*(s2-y1)*(s2-b-t1);
    }
    return (t2-t1)*(s2-s1);
}

int main()
{
    int T,cas=0;
    cin>>T;
    while(T--){
        scanf("%lf%lf%lf%lf%lf",&t1,&t2,&s1,&s2,&w);
        double ans=(t2-t1)*(s2-s1);
        printf("Case #%d: %.8lf\n",++cas,(geta(w)-geta(-w))/ans);
    }
    return 0;
}