Description
Solution
可以先枚举分数线
有一种麻烦的做法,可以直接DP
F[i][j][k],G[i][j][k] 分别是前缀和后缀,做到第i位,超线j个,压线k个,然后对于每个点再将它们组合一下,然后前缀和优化,还要注意强制满足分数线(即两个k必须有一个大于0,或者这个点压线)非常的繁琐
考虑一种简单的做法
不妨直接枚举分数线,并且强制令这个点是通过的里面最后一个(即它后面的压线的都过不了)
那么DP就变的简单了,只需要处理前面多少个通过,后面有多少个大于,直接组合即可
Code
由于本蒟蒻比较菜,比赛的时候YY出了上面猥琐至极的方法,比赛结束都没有调出来QAQ
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define imax(a,b) ((a>b)?a:b)
#define imin(a,b) ((a<b)?a:b)
#define N 30
#define M 1005
using namespace std;
int n,l[N],r[N],m,lx,rx;
double f[N][N][N],g[N][N][N],h[N][N][N],t[N][N][N],s[N][2];
int main()
{
cin>>n;
lx=1000;
fo(i,1,n) scanf("%d",&l[i]),lx=min(lx,l[i]);
fo(i,1,n) scanf("%d",&r[i]),rx=max(rx,r[i]);
cin>>m;
fo(i,0,n+1) s[i][0]=s[i][1]=0;
fo(lim,lx,rx)
{
fo(i,0,n+1) fo(j,0,n+1)
{
fo(k,0,n+1) h[i][j][k]=f[i][j][k]=g[i][j][k]=t[i][j][k]=0;
}
f[0][0][0]=h[n+1][0][0]=1;
fo(i,1,n)
{
fo(j,0,m)
{
fo(k,0,n)
{
if(f[i-1][j][k]>0)
{
f[i][j][k]+=f[i-1][j][k]*imin(imax(0,lim-l[i])*1.0/(r[i]-l[i]+1),1);
f[i][j+1][k]+=f[i-1][j][k]*imin(imax(0,r[i]-lim)*1.0/(r[i]-l[i]+1),1);
if(l[i]<=lim&&lim<=r[i]) f[i][j][k+1]+=f[i-1][j][k]/(r[i]-l[i]+1);
}
}
}
}
fod(i,n,1)
{
fo(j,0,m)
{
fo(k,0,n)
{
if(h[i+1][j][k]>0)
{
h[i][j][k]+=h[i+1][j][k]*imin(imax(0,lim-l[i])*1.0/(r[i]-l[i]+1),1);
h[i][j+1][k]+=h[i+1][j][k]*imin(imax(0,r[i]-lim)*1.0/(r[i]-l[i]+1),1);
if(l[i]<=lim&&lim<=r[i]) h[i][j][k+1]+=h[i+1][j][k]/(r[i]-l[i]+1);
}
}
}
}
fod(i,n+1,0) fo(j,0,n+1) fod(k,n+1,0) t[i][j][k]=h[i][j][k]+t[i][j][k+1],g[i][j][k]=f[i][j][k]+g[i][j][k+1];
fo(i,1,n)
{
fo(j,0,m-1)
{
int c;
if(j%4==0||j%4==3) c=0;
else c=1;
double q=0,p=0,p1=0;
fo(x,0,m-j-1)
{
p+=t[i+1][x][m-j-1-x];
if(m-j-1-x>0) p1+=t[i+1][x][m-j-1-x];
}
fo(k,0,j)
{
if(j-k)
{
q+=g[i-1][k][j-k+1]*t[i+1][m-j-1][0];
q+=f[i-1][k][j-k]*p;
}
else q+=f[i-1][k][j-k]*p1;
}
s[i][c]+=q*imin(1,imax(0,r[i]-lim)*1.0/(r[i]-l[i]+1));
if(l[i]<=lim&&lim<=r[i])
{
double q=0,p=0;
fo(x,0,m-j-1) p+=t[i+1][x][m-j-1-x];
fo(k,0,j) q+=f[i-1][k][j-k];
s[i][c]+=p*q/(r[i]-l[i]+1);
}
}
}
}
fo(i,1,n) printf("%.6lf %.6lf\n",s[i][0],s[i][1]);
}