按这个顺序来做做
poj2096->zoj3329->hdu4035
/**
dp求期望的题。
题意:
有n个房间,由n-1条隧道连通起来,实际上就形成了一棵树,
从结点1出发,开始走,在每个结点i都有3种可能:
1.被杀死,回到结点1处(概率为ki)
2.找到出口,走出迷宫 (概率为ei)
3.和该点相连有m条边,随机走一条
求:走出迷宫所要走的边数的期望值。
设 E[i]表示在结点i处,要走出迷宫所要走的边数的期望。E[1]即为所求。
叶子结点:
E[i] = ki*E[1] + ei*0 + (1-ki-ei)*(E[father[i]] + 1);
= ki*E[1] + (1-ki-ei)*E[father[i]] + (1-ki-ei);
非叶子结点:(m为与结点相连的边数)
E[i] = ki*E[1] + ei*0 + (1-ki-ei)/m*( E[father[i]]+1 + ∑( E[child[i]]+1 ) );
= ki*E[1] + (1-ki-ei)/m*E[father[i]] + (1-ki-ei)/m*∑(E[child[i]]) + (1-ki-ei);
设对每个结点:E[i] = Ai*E[1] + Bi*E[father[i]] + Ci;
对于非叶子结点i,设j为i的孩子结点,则
∑(E[child[i]]) = ∑E[j]
= ∑(Aj*E[1] + Bj*E[father[j]] + Cj)
= ∑(Aj*E[1] + Bj*E[i] + Cj)
带入上面的式子得
(1 - (1-ki-ei)/m*∑Bj)*E[i] = (ki+(1-ki-ei)/m*∑Aj)*E[1] + (1-ki-ei)/m*E[father[i]] + (1-ki-ei) + (1-ki-ei)/m*∑Cj;
由此可得
Ai = (ki+(1-ki-ei)/m*∑Aj) / (1 - (1-ki-ei)/m*∑Bj);
Bi = (1-ki-ei)/m / (1 - (1-ki-ei)/m*∑Bj);
Ci = ( (1-ki-ei)+(1-ki-ei)/m*∑Cj ) / (1 - (1-ki-ei)/m*∑Bj);
对于叶子结点
Ai = ki;
Bi = 1 - ki - ei;
Ci = 1 - ki - ei;
从叶子结点开始,直到算出 A1,B1,C1;
E[1] = A1*E[1] + B1*0 + C1;
所以
E[1] = C1 / (1 - A1);
若 A1趋近于1则无解...
**/
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
#define S(a) scanf("%d",&(a))
#define F(a) scanf("%lf",&(a))
const int MAXnn=11111;
const double mmm=1E-10;
double e[MAXnn],k[MAXnn];
double A[MAXnn],B[MAXnn],C[MAXnn];
vector<int> v[MAXnn];
int T,n;
double fab(double a,double b)
{
return a>b?a-b:b-a;
}
void input()
{
S(n);
for(int i=1;i<=n;i++)
v[i].clear();
int t1,t2;
for(int i=0;i<n-1;i++)
{
S(t1);
S(t2);
v[t1].push_back(t2);
v[t2].push_back(t1);
}
for(int i=1;i<=n;i++)
{
F(k[i]);
F(e[i]);
k[i]/=100.0;
e[i]/=100.0;
}
}
bool search(int i,int father)
{
if(father!=-1&&v[i].size()==1)
{
A[i]=k[i];
B[i]=1-k[i]-e[i];
C[i]=1-k[i]-e[i];
return true;
}
A[i]=k[i];
B[i]=(1-k[i]-e[i])/v[i].size();
C[i]=1-k[i]-e[i];
double tmp=0;
for(int j=0;j<v[i].size();j++)
{
if(v[i][j]==father) continue;
if(!search(v[i][j],i)) return false;
A[i]+=B[i]*A[v[i][j]];
C[i]+=B[i]*C[v[i][j]];
tmp+=B[i]*B[v[i][j]];
}
if(fab(tmp,1)<mmm) return false;
A[i]/=(1-tmp);
B[i]/=(1-tmp);
C[i]/=(1-tmp);
return true;
}
void work(int ca){
input();
printf("Case %d: ",ca);
if(search(1,-1)&&fab(1,A[1])>mmm)
printf("%f\n",C[1]/(1-A[1]));
else
printf("impossible\n");
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("G:/1.txt","r",stdin);
freopen("G:/2.txt","w",stdout);
#endif
S(T);
int ca=1;
for(ca=1;ca<=T;ca++)
{
work(ca);
}
return 0;
}