HDU 4035：Maze（概率DP）

http://acm.split.hdu.edu.cn/showproblem.php?pid=4035

 

Maze

Special Judge

Problem Description

 

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”.

 

Sample Input

 

3 

3

1 2

1 3

0 0

100 0

0 100

3

1 2

2 3

0 0

100 0

0 100

6

1 2

2 3

1 4

4 5

4 6

0 0

20 30

40 30

50 50

70 10

20 60

 

Sample Output

 

Case 1: 2.000000

Case 2: impossible

Case 3: 2.895522

 

题意：给出一棵树，从节点1走起，每个节点有一个被杀的几率k[i]，被杀的话就要回到节点1从头开始，还有一个逃脱几率e[i]，可以逃脱迷宫，与该节点相连的共有m条边，走任意一条边的几率相等（包括走回头路），求走出迷宫所走的边数的期望。

思路：这道题想了好久实在不会做，只能去看kuangbin菊苣的题解了，大概理解了怎么做，好像有点树型DP的思想。等学一点树型DP再回来自己做。

http://www.cnblogs.com/kuangbin/archive/2012/10/03/2711108.html

 1 #include <cstdio>
 2 #include <algorithm>
 3 #include <iostream>
 4 #include <cstring>
 5 #include <string>
 6 #include <cmath>
 7 #include <queue>
 8 #include <vector>
 9 using namespace std;
10 #define N 10010
11 const double eps = 1e-9;
12 
13 double k[N], e[N];
14 double A[N], B[N], C[N];
15 vector<int> G[N];
16 
17 bool dfs(int u, int pre)
18 {
19     int l = G[u].size();
20     A[u] = k[u];
21     B[u] = (1 - k[u] - e[u]) / l;
22     C[u] = 1 - k[u] - e[u];
23     double tmp = 0;
24     for(int i = 0; i < l; i++) {
25         int v = G[u][i];
26         if(v == pre) continue;
27         if(!dfs(v, u)) return false;
28         A[u] += (1 - k[u] - e[u]) * A[v] / l;
29         C[u] += (1 - k[u] - e[u]) * C[v] / l;
30         tmp += (1 - k[u] - e[u]) * B[v] / l ;
31     }
32     if(fabs(tmp - 1) < eps) return false;
33     A[u] /= (1 - tmp);
34     B[u] /= (1 - tmp);
35     C[u] /= (1 - tmp);
36     return true;
37 }
38 
39 int main()
40 {
41     int t, cas = 1;
42     scanf("%d", &t);
43     while(t--) {
44         memset(A, 0, sizeof(A));
45         memset(B, 0, sizeof(B));
46         memset(C, 0, sizeof(C));
47         int n;
48         scanf("%d", &n);
49         for(int i = 0; i <= n; i++)
50             G[i].clear();
51         for(int i = 1; i < n; i++) {
52             int u, v;
53             scanf("%d%d", &u, &v);
54             G[u].push_back(v);
55             G[v].push_back(u);
56         }
57         for(int i = 1; i <= n; i++) {
58            scanf("%lf%lf", &k[i], &e[i]);
59            k[i] /= 100; e[i] /= 100;
60         }
61         printf("Case %d: ", cas++);
62         if(dfs(1, -1) && fabs(A[1] - 1) > eps) {
63             printf("%.6f\n",  C[1] / (1 - A[1]));
64         } else {
65             puts("impossible");
66         }
67     }
68 
69     return 0;
70 }

 

转载于:https://www.cnblogs.com/fightfordream/p/5796616.html