题意:给出一棵树,每条边等可能的从[1, L]中取值,问这棵树所有点之间的距离都小于等于s的概率。
思路:树上的概率DP,用状态dp[i][j]表示以i为根节点的子树中所有点对之间的距离小于等于s且从i出发的最长距离是j的概率,那么就可以写出状态转移方程,每次dfs将当前的子树与前面的子树的结果合并,并且注意每次合并的两条链的总长不能超过s。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
int n, l, s;
vector<int> G[80];
double dp[80][550], p, tmp[550], sumv[2][550];
void dfs(int cur, int fa) {
for(int i = 1; i <= s; i++) dp[cur][i] = 0;
dp[cur][0] = 1.0;
for(int i = 0; i < G[cur].size(); i++) {
int u = G[cur][i];
if(u == fa) continue;
dfs(u, cur);
for(int j = 0; j <= s; j++) tmp[j] = 0;
for(int j = 0; j <= s; j++) {
for(int k = 0; k <= l; k++)
if(k+j<=s) tmp[k+j] += p*dp[u][j];
}
sumv[0][0] = dp[cur][0];
for(int j = 1; j <= s; j++) sumv[0][j] = sumv[0][j-1] + dp[cur][j];
sumv[1][0] = tmp[0];
for(int j = 1; j <= s; j++) sumv[1][j] = sumv[1][j-1] + tmp[j];
for(int j = 0; j <= s; j++) {
int t = min(j, s-j);
double shit = dp[cur][j];
dp[cur][j] = dp[cur][j]*sumv[1][t] + sumv[0][t]*tmp[j];
if(j*2 <= s) dp[cur][j] -= tmp[j] * shit;
}
}
}
int main() {
//freopen("input.txt", "r", stdin);
int T; cin >> T;
int kase = 0;
while(T--) {
scanf("%d%d%d", &n, &l, &s);
for(int i = 1; i <= n; i++) G[i].clear();
for(int i = 1; i < n; i++) {
int u, v; scanf("%d%d", &u, &v);
G[u].push_back(v);
G[v].push_back(u);
}
p = 1.0/(l+1);
dfs(1, 0);
double ans = 0;
for(int i = 0; i <= s; i++) ans += dp[1][i];
printf("Case %d: %.6f\n", ++kase, ans);
}
return 0;
}