BZOJ 5004: 开锁魔法II 期望 + 组合

EM-LGH

于 2019-08-06 16:08:00 发布

阅读量130

点赞数

本文链接：https://blog.csdn.net/liyong1009s/article/details/98698630

版权

Code:

#include <cstdio>
#include <cmath>
#include <algorithm> 
#include <cstring>  
#define setIO(s) freopen(s".in","r",stdin) 
#define N 307 
using namespace std;          
double fac[N],f[N][N];    
bool vis[N];  
int cir[N],sum[N],a[N];  
inline void calc() 
{    
    int n,k,i,j,tot=0,p; 
    scanf("%d%d",&n,&k);  
    memset(vis,0,sizeof(vis)); 
    memset(f,0,sizeof(f)); 
    for(i=1;i<=n;++i) scanf("%d",&a[i]), fac[i]=fac[i-1]+log(i);     
    for(i=1;i<=n;++i) 
    { 
        if(vis[i]) continue; 
        cir[++tot]=0;           
        for(j=i;!vis[j];j=a[j]) vis[j]=1,cir[tot]++;         
    }
    sum[0]=0,f[0][0]=1.0000; 
    for(i=1;i<=tot;++i) sum[i]=sum[i-1]+cir[i];        
    for(i=1;i<=tot;++i) 
        for(j=i-1;j<k&&j<=sum[i-1];++j) 
            for(p=1;p<=cir[i]&&j+p<=k;++p)            
            {      
                double tmp=exp(fac[sum[i-1]]+fac[cir[i]]+fac[j+p]+fac[sum[i]-j-p]-fac[j]-fac[sum[i-1]-j]-fac[p]-fac[cir[i]-p]-fac[sum[i]]); 
                f[i][j+p]+=f[i-1][j]*tmp;              
            }    
    printf("%.9f\n",f[tot][k]);      
}   
int main() 
{ 
    // setIO("input"); 
    int T,i,j; 
    scanf("%d",&T);  
    for(i=1;i<=T;++i) calc(); 
    return 0; 
}