NWERC 2017(English Restaurant-期望)

Random groups of sizes between 1 and g people arrive at the
restaurant. Each group occupies the smallest table that fits the
group, or leaves if there is no such table.
Find the average occupancy of after t groups have arrived.
(1≤n≤100,1≤g,ci≤200,1≤t≤100)

把桌子数排序，并在后面添加若干>g的桌子。
最后坐的位置一定可以分为若干区间。
每个区间可以独立计算。

对$[l,r]$暴力枚举最后坐下的桌子k。
显然$E_{l,r}=\sum_{k=l}^r {P_{(k最后被坐)}*(E_{l,k-1}+E_{k+1,r} +E(桌子k坐下人数) )}$
这不好统计。
我们考察期望=各方案的值的和P/方案数Q
这样就能统计了
$\frac {p1} {q1}$ 与$\frac {p2}{q2}$是独立事件，它们组合后变为
$\frac {p1*q2+p2*q1} {q1*q2}$
最后对k累加方案数。

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (501)
int n,g,t;
int c[MAXN];

double C[MAXN][MAXN];
void prework() {
    int n=400;
    C[0][0]=1;
    For(i,400) {
        C[i][0]=1;
        For(j,i) C[i][j]=C[i-1][j-1]+C[i-1][j];
    }
}
int n2(int n){return n*(n+1)/2;}
void fadd(ld &a,ld &b, ld c,ld d) { //a/b+c/d=(ad+bc)/bd;
    a=a*d+b*c;
    b*=d;
}
pi rfrac(int l,int r ,int g) {
    int lb=min(g,l>0?c[l-1]:0);
    int rb=min(g,c[r]);
    return {c[r]<=211?(n2(rb)-n2(lb)):0 ,
    rb-lb
    };
} 
ld num[411][411],den[411][411];
ld dpn[411][411] ,dpd[411][411];
int main()
{
    MEM(num) MEM(den) MEM(dpn) MEM(dpd)
    prework();
    freopen("E.in","r",stdin);
//  freopen(".out","w",stdout);
    n=read(),g=read(),t=read();
    For(i,n) c[i]=read();
    sort(c+1,c+1+n);
    For(i,t) c[++n]=300;
    c[0]=0;
    For(i,n) c[i-1]=c[i];
    c[n]=0;

    Rep(r,n) {
        tie(num[r][r],den[r][r]) = rfrac(r,r,g);
        RepD(l,r-1) { 
            num[l][r]=den[l][r]=0;
            Fork(k,l,r) {
                ld sum=0,ways=C[r-l][k-l];
                tie(sum,ways)=rfrac(l,k,g);
                if (l<k) fadd(sum,ways,num[l][k-1],den[l][k-1]);
                if (r>k) fadd(sum,ways,num[k+1][r],den[k+1][r]);

                num[l][r] +=sum*C[r-l][k-l];
                den[l][r] +=ways*C[r-l][k-l];
            }
        }
    }

    RepD(i,t-1) { //i-t tables 
        RepD(j,n-1) { // j-n groups
            if (t-i<=n-j) {
                dpn[i][j] = num[j][j+t-i-1];
                dpd[i][j] = den[j][j+t-i-1];

            }
        }
    }
    RepD(i,t-1) {
        RepD(j,n-1) {
            Fork(ni,i+1,t-1) {
                Fork(ns,j+ni-i+1,n-1) {
                    ld sum = 0.0, ways = C[t-i][t-ni];
                    fadd(sum, ways, num[j][j+(ni-i)-1], den[j][j+(ni-i)-1]);
                    fadd(sum, ways, dpn[ni][ns], dpd[ni][ns]);
                    dpn[i][j] += sum;
                    dpd[i][j] += ways;
                }
            }
        }
    }

    ld ansn=0,ansd=0;
    Rep(i,n) {
        ansn+=dpn[0][i] ,ansd+= dpd[0][i];
    }
    printf("%.13lf\n",(double)(ansn/ansd));

    return 0;
}