码迷,mamicode.com
首页 > 其他好文 > 详细

ZOJ 3822 Domination 概率DP

时间:2014-10-14 23:37:59      阅读:214      评论:0      收藏:0      [点我收藏+]

标签:style   http   color   io   os   ar   for   sp   2014   


概率DP


Domination

Time Limit: 8 Seconds      Memory Limit: 131072 KB      Special Judge

Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What‘s more, he bought a large decorative chessboard with N rows and M columns.

Every day after work, Edward will place a chess piece on a random empty cell. A few days later, he found the chessboard was dominated by the chess pieces. That means there is at least one chess piece in every row. Also, there is at least one chess piece in every column.

"That‘s interesting!" Edward said. He wants to know the expectation number of days to make an empty chessboard of N × M dominated. Please write a program to help him.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

There are only two integers N and M (1 <= NM <= 50).

Output

For each test case, output the expectation number of days.

Any solution with a relative or absolute error of at most 10-8 will be accepted.

Sample Input

2
1 3
2 2

Sample Output

3.000000000000
2.666666666667

Author: JIANG, Kai
Source: The 2014 ACM-ICPC Asia Mudanjiang Regional Contest
Submit    Status


#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

const double eps = 1e-8;

int n,m;
double ans;
double dp[3000][60][60];

int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--)
    {
        scanf("%d%d",&n,&m);
        ans=0.0;
        memset(dp,0,sizeof(dp));
        dp[1][1][1]=1.;
        for(int num=1;num<n*m;num++)
        {
            for(int r=0;r<=n;r++)
            {
                for(int c=0;c<=m;c++)
                if(r*c>=num)
                {
                    if(r==n&&c==m) continue;
                    int one = r*c-num;
                    int two = c*n-r*c;
                    int three = r*m-r*c;
                    int four = n*m - r*m - c*n + r*c;
                    int all = n*m - num;
                    dp[num+1][r][c]+=dp[num][r][c]*(one*1./all);
                    dp[num+1][r+1][c]+=dp[num][r][c]*(two*1./all);
                    dp[num+1][r][c+1]+=dp[num][r][c]*(three*1./all);
                    dp[num+1][r+1][c+1]+=dp[num][r][c]*(four*1./all);
                }
            }
        }
        for(int i=1;i<=n*m;i++)
            ans+=dp[i][n][m]*i;

        printf("%.10lf\n",ans);
    }
    return 0;
}


ZOJ 3822 Domination 概率DP

标签:style   http   color   io   os   ar   for   sp   2014   

原文地址:http://blog.csdn.net/ck_boss/article/details/40084999

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!