HDU 5001 Walk - c++编程基础 - C语言编程开发

TOP

HDU 5001 Walk

2015-07-20 17:41:58 来源: 作者: 【大中小】浏览:2次

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

Source 2014 ACM/ICPC Asia Regional Anshan Online

暴力。dp[d][i]表示走了d步时走到i的概率。

#include
  
   
#include
   
     #include
    
      #include
     
       #include
      
        #include
       
         using namespace std; typedef long long LL; int t,n,m,d; double dp[10000+10][55]; vector
        
         v[55]; void solve(int x) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) dp[0][i]=1.0/n; for(int i=0;i
         
          
 
          另附别人丧心病狂的头文件，我也是醉了


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：hdu-1016 Prime Ring Problem	下一篇：HDU - 5001 Walk

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: