HDU4035 Maze 题解

题目链接

分析：

令$f_u$表示在点$u$时期望需要经过多少条边才能逃出，记$so{n}_u$为点$u$的儿子的集合，$f{a}_u$为$u$的父亲，$d_u$为点$u$的度，那么显然有：
$$f_u=k_u{f}_1+(1-k_u-e_u)((\sum _{v\in so{n}_u}{f}_v+f_{f{a}_u})/d_u+1)\text{\hspace{1em}(1)}$$
经典套路，设：
$$f_u=a_u{f}_1+b_u{f}_{f{a}_u}+c_u\text{\hspace{1em}(2)}$$
$将(2)$式带入$(1)$式，得：
$$f_u=k_u{f}_1+(1-k_u-e_u)(\sum _{v\in so{n}_u}(a_v{f}_1+b_v{f}_u+c_v)+f_{f{a}_u})/d_u+(1-k_u-e_u)$$
令$t=(1-k_u-e_u)/d_u,Sa={\sum }_{v\in so{n}_u}{a}_v$， $Sb,Sc$以此类推，整理一下，得：
$$f_u=\frac{(k_u+tSa)f_1+t{f}_{f{a}_u}+tSc+t{d}_u}{1-tSb}$$
即：
$$a_u=\frac{k_u+tSa}{1-tSb}，b_u=\frac{t}{1-tSb}，c_u=\frac{tSc+t{d}_u}{1-tSb}$$
特别地，对于叶子节点，有$Sa=Sb=Sc=0,d_u=1$。带入式子显然有：
$$t=1-k_u-e_u,a_u=k_u,b_u=1-k_u-e_u,c_u=1-k_u-e_u$$
递归处理一遍即可。求出$a_1,b_1,c_1$后，有$f_1=a_1{f}_1+(b_1\times 0)+c_1$，即答案为$f_1=\frac{c_1}{1-a_1}$

注意分母为$0$时输出impossible.

Code:

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 1e4 + 50;
const double eps = 1e-9;
int T,n,x,y,cnt,last[maxn],d[maxn];
double a[maxn],b[maxn],c[maxn],k[maxn],e[maxn];
struct Edge{
    int v,nxt;
}_e[2 * maxn];
int read(){
    int x = 0;
    char c = getchar();
    while(c < '0' || c > '9') c = getchar();
    while(c >= '0' && c <= '9') x = x * 10 + (c ^ 48),c = getchar();
    return x;
}
inline void insert(int x,int y){
    cnt ++,_e[cnt].v = y,_e[cnt].nxt = last[x],last[x] = cnt;
}
bool dfs(int u,int fa){
    if(d[u] == 1 && u != 1){//叶子节点，直接赋值
        a[u] = k[u],b[u] = 1 - k[u] - e[u],c[u] = 1 - k[u] - e[u];
        return 1;
    }
    double Sa = 0,Sb = 0,Sc = 0;
    for(int i = last[u]; i; i = _e[i].nxt){
        int v = _e[i].v;
        if(v == fa) continue;
        if(!dfs(v,u)) return 0;
        Sa += a[v],Sb += b[v],Sc += c[v];
    }
    double t = (1 - k[u] - e[u]) / d[u];
    if(fabs(1 - t * Sb) < eps) return 0;//分母为零，无解
    a[u] = (k[u] + t * Sa) / (1 - t * Sb);
    b[u] = t / (1 - t * Sb);
    c[u] = (t * Sc + t * d[u]) / (1 - t * Sb);
    return 1;
}
int main(){
    T = read();
    for(int i = 1; i <= T; i ++){
        n = read(),cnt = 0;
        for(int i = 1; i <= n; i ++) d[i] = 0,last[i] = 0;
        for(int i = 1; i < n; i ++){
            x = read(),y = read(),d[x] ++,d[y] ++;
            insert(x,y),insert(y,x);
        }
        for(int i = 1; i <= n; i ++) k[i] = read() / 100.0,e[i] = read() / 100.0;
        if(dfs(1,0) && fabs(1 - a[1]) >= eps) printf("Case %d: %f\n",i,c[1] / (1 - a[1]));//有解
        else printf("Case %d: impossible\n",i);
    }
    return 0;
}