2014鞍山网络预选赛1005（概率DP）hdu5001

原创于 2014-09-14 02:22:07 发布 · 1.1k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

概率DP

本文介绍了一种使用动态规划解决在给定的连通双向图上进行随机行走的问题，旨在计算每个节点未被覆盖的概率。通过详细的算法实现和代码示例，帮助读者理解如何有效地解决此类概率计算问题。

Walk

Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 209 Accepted Submission(s): 146
Special Judge

Problem Description

I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.

The nation looks like a connected bidirectional graph, and I am randomly walking on it. It means when I am at node i, I will travel to an adjacent node with the same probability in the next step. I will pick up the start node randomly (each node in the graph has the same probability.), and travel for d steps, noting that I may go through some nodes multiple times.

If I miss some sights at a node, it will make me unhappy. So I wonder for each node, what is the probability that my path doesn't contain it.

Input

The first line contains an integer T, denoting the number of the test cases.

For each test case, the first line contains 3 integers n, m and d, denoting the number of vertices, the number of edges and the number of steps respectively. Then m lines follows, each containing two integers a and b, denoting there is an edge between node a and node b.

T<=20, n<=50, n-1<=m<=n*(n-1)/2, 1<=d<=10000. There is no self-loops or multiple edges in the graph, and the graph is connected. The nodes are indexed from 1.

Output

For each test cases, output n lines, the i-th line containing the desired probability for the i-th node.

Your answer will be accepted if its absolute error doesn't exceed 1e-5.

Sample Input

Sample Output

0.0000000000
0.0000000000
0.0000000000
0.0000000000
0.0000000000
0.6993317967
0.5864284952
0.4440860821
0.2275896991
0.4294074591
0.4851048742
0.4896018842
0.4525044250
0.3406567483
0.6421630037

题意：RT

思路：这题比赛的时候是队友过的，不过还是想做一做，一个人会不如两个人都会，哈~~

DP[ i ][ j ]表示当前走到 i 结点，没有经过 j 的概率

暴力转移d步就好了，每一步都遍历每条边

假设i和j有边，现在这一步要从 i 走到 j 不经过 k ，转移为DP[j][k]+=DP[i][k]，其中k不能等于 j

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define maxn 55

vectorhead[maxn];
double dp[2][maxn][maxn];

int main()
{
    int t;

    scanf("%d",&t);

    while(t--)
    {
        int n,m,d;

        scanf("%d%d%d",&n,&m,&d);

        for(int i=1;i<=n;++i)head[i].clear();

        memset(dp,0,sizeof(dp));

        for(int i=0;i

标签

#ACM #hdu