概率DP

Maze
When wake up, lxhgww find himself in a huge maze.

The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms is connected by one and only one path. Initially, lxhgww is in room 1. Each room has a dangerous trap. When lxhgww step into a room, he has a possibility to be killed and restart from room 1. Every room also has a hidden exit. Each time lxhgww comes to a room, he has chance to find the exit and escape from this maze.

Unfortunately, lxhgww has no idea about the structure of the whole maze. Therefore, he just chooses a tunnel randomly each time. When he is in a room, he has the same possibility to choose any tunnel connecting that room (including the tunnel he used to come to that room).
What is the expect number of tunnels he go through before he find the exit?
Input
First line is an integer T (T ≤ 30), the number of test cases.

At the beginning of each case is an integer N (2 ≤ N ≤ 10000), indicates the number of rooms in this case.

Then N-1 pairs of integers X, Y (1 ≤ X, Y ≤ N, X ≠ Y) are given, indicate there is a tunnel between room X and room Y.

Finally, N pairs of integers Ki and Ei (0 ≤ Ki, Ei ≤ 100, Ki + Ei ≤ 100, K1 = E1 = 0) are given, indicate the percent of the possibility of been killed and exit in the ith room.
Output
For each test case, output one line “Case k: ”. k is the case id, then the expect number of tunnels lxhgww go through before he exit. The answer with relative error less than 0.0001 will get accepted. If it is not possible to escape from the maze, output “impossible”.

题意：
有n个房间，由n-1条隧道连通起来，实际上就形成了一棵树，从结点1出发，开始走，在每个结点i都有3种可能：
1.被杀死，回到结点1处
2.找到出口，走出迷宫
3.和该点相连的边，随机走一条
如果求从s号节点逃出去的期望dp[s]，那么dp[s]和s的子节点和s的父节点有关，而欲求s的子节点时，子节点又和父节点s有关
求i的结果要求其父亲和儿子的，这就出现了交叉，想办法变为之与父亲有关
对于叶子结点
ai = ki;
bi = 1 - ki - ei;
ci = 1 - ki - ei;
从叶子结点开始，直到算出 a1,b1,c1;
E[1] = a1$\ast$E[1] + b1*0 + c1;
所以
E[1] = c1 / (1 - a1);

代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const double eps=1e-12;
int n，hd[10010],nt[40040],to[40010],sz[10010],ct;
double k[10010],e[10010];
double a[10010],b[10010],c[10010];
void add(int x,int y)
{
	nt[++ct]=hd[x];
	hd[x]=ct;
	to[ct]=y;
}
void dfs(int x,int f)
{
	bool flag=1;
	for(int i=hd[x];i;i=nt[i])
	{
		int v=to[i];
		if(v==f)
		continue;
		flag=0;
		dfs(v,x);
	}
	if(flag)
	{
		a[x]=k[x];
		b[x]=1-k[x]-e[x];
		c[x]=1-k[x]-e[x];
	}
	else
	{
		double d=1,sa=0,sc=0;
		for(int i=hd[x];i;i=nt[i])
		{
			int v=to[i];
			if(v==f)
			continue;
			d-=(1-k[x]-e[x])/sz[x]*b[v];
			sa+=a[v];
			sc+=c[v];
		}
		a[x]=(k[x]+(1-k[x]-e[x])/sz[x]*sa)/d;
		b[x]=(1-k[x]-e[x])/sz[x]/d;
		c[x]=((1-k[x]-e[x])+(1-k[x]-e[x])/sz[x]*sc)/d;
	}
}
int main()
{
	int t,cas=0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		memset(hd,0,sizeof hd);
		memset(sz,0,sizeof sz);
		ct=0;
		for(int i=1,a,b;i<n;i++)
		{
			scanf("%d%d",&a,&b);
			sz[a]++,sz[b]++;
			add(a,b),add(b,a);
		}
		for(int i=1;i<=n;i++)
		{
			scanf("%lf%lf",&k[i],&e[i]);
			k[i]/=100;
			e[i]/=100;
		}
		dfs(1,0);
		printf("Case %d: ",++cas);
		if(1-a[1]<eps)
		printf("impossible\n");
		else
		printf("%.6lf\n",c[1]/(1-a[1]));
	}
	return 0;
}