题目链接:http://www.icpc.moe/onlinejudge/showProblem.do?problemCode=3822
题意:n*m的格子里放棋子,一次只能放一个,问当棋盘的所有列和所有行中都至少有一个棋子时的期望次数。
思路:dp[k][i][j]表示放了k个棋子,已经占了i行j列的期望。假设占了i行j列,那么至少应该放max(i,j)个棋子,最多放i*j个棋子(i*j区域全部放满)。
那么递推式为:dp[k][i][j] = (i*j-k)/(n*m-k)*dp[k+1][i][j] + ( (n-i)*j )/(n*m-k)*dp[k+1][i+1][j] (多占了一行) + ( i*(m-j) )/(n*m-k)*dp[k+1][i][j+1] + ( (n-i)*(m-j) )/(n*m-k)*dp[k+1][i+1][j+1] + 1
注意dp[0][0][0]只能向dp[1][1][1]转移,所以dp[1][1][1] + 1即为答案。
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
double dp[2509][52][52];
int T;
int n,m;
int sum;
int main()
{
cin>>T;
while(T--)
{
scanf("%d %d",&n,&m);
sum = n*m;
int maxn = max(n,m);
Clean(dp,0);
rep(i,maxn,sum) dp[i][n][m] = 0;
Rrep(i,n,1)
Rrep(j,m,1)
{
if ( i == n && j == m ) continue;
int mink = max(i,j);
int maxk = i*j;
//int maxk = i*j;
Rrep(k,maxk,mink)
{
dp[k][i][j] = ( (maxk-k)*dp[k+1][i][j] + (n-i)*j*dp[k+1][i+1][j] + i*(m-j)*dp[k+1][i][j+1] + (n-i)*(m-j)*dp[k+1][i+1][j+1] )/(sum-k) + 1;
}
}
printf("%0.11lf\n",dp[1][1][1]+1);
}
return 0;
}