CF865C Gotta Go Fast

CF865C Gotta Go Fast
f[i][j]表示在进行关卡i时的时间。
1.在关卡i前重新开始，期望值为mid
2.关卡i最快方式通过，时间为(dp[i+1][j+a[i]]+a[i])p[i]/100
3.关卡i最慢方式通过，时间为(dp[i+1][j+b[i]+b[i]])(1-p[i]/100)

#include <iostream>
#include <string>
#include <complex>
#include<functional>
#include<cmath>
#include<ctime>
#include<cstring>
#include<algorithm>
using namespace std;
typedef complex<double> cp;
#define ll long long
#define  re register
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define scf(x) scanf("%lf",&x)
#define fo(a,b,c)for(int a=b;a<=c;a++)
#define getname(x) #x
#define ri register int
const int maxn=5e3+5;
double dp[100][maxn];
#define eps 1e-9
int n,t;
struct tp
{
    int f,s;double p;
}p[maxn];
int  i,j;
inline bool judge(double mid)
{
    for( i=n;i>=1;i--){
        for( j=t+1;j<maxn;j++)
            dp[i+1][j]=mid;
        for( j=0;j<=t;j++){
            dp[i][j]=min((dp[i+1][j+p[i].f]+p[i].f)*(p[i].p/100.0)+(dp[i+1][j+p[i].s]+p[i].s)*((100.0-p[i].p)/100.0),mid);
        }
    }
    return dp[1][0]<mid;
}
int main()
{
    sci(n);sci(t);
    for( i=1;i<=n;i++)
        sci(p[i].f),sci(p[i].s),scf(p[i].p);
    double l=0,r=1e9;
    while(l+eps<r){
        double mid=(l+r)/2;
        if(judge(mid))
            r=mid;
        else l=mid;
    }
    printf("%.10f",l);
}