hdu 5001 walk
来源:互联网 发布:淘宝充话费多久到账啊 编辑:程序博客网 时间:2024/05/16 01:26
Walk
Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 170 Accepted Submission(s): 117
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.
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.
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.
Your answer will be accepted if its absolute error doesn't exceed 1e-5.
Sample Input
25 10 1001 22 33 44 51 52 43 52 51 41 310 10 101 22 33 44 55 66 77 88 99 104 9
Sample Output
0.00000000000.00000000000.00000000000.00000000000.00000000000.69933179670.58642849520.44408608210.22758969910.42940745910.48510487420.48960188420.45250442500.34065674830.6421630037
Source
2014 ACM/ICPC Asia Regional Anshan Online
那么就直接去掉一个点,暴力就行了。
dp[i][j] = (求和)i/N*(dp[k][j-1])
从k走到i,第j-1步到第j步
遇到当前算的点,因为没经过,所以直接continue
具体代码课参见http://blog.csdn.net/u011345136/article/details/39256089
0 0
- hdu 5001 Walk(概率)
- HDU 5001 Walk (暴力)
- HDU - 5001 Walk
- hdu 5001 walk
- HDU 5001 Walk
- hdu 5001 Walk
- HDU 5001 Walk
- HDU 5001 Walk
- HDU 5001 Walk
- hdu 5001 Walk
- HDU 5001 Walk
- hdu 5001 Walk (概率dp)
- [概率dp] hdu 5001 Walk
- HDU - 5001 Walk(概率dp)
- hdu 5001 Walk ( 概率DP )
- hdu 5001 Walk 概率DP
- hdu 5001 Walk 【概率dp】
- HDU 5001 Walk (概率dp)
- Iptables强制访问外部站点
- 设计模式笔记-单例模式
- 给大家说明。也议MySQL中隐式转换
- 输入模块中该注意的知识点:
- 快速排序改进算法
- hdu 5001 walk
- hdu-1016 Prime Ring Problem
- 给大家说明。升级数据字典,解决ORA-01092: ORACLE instance terminated. Disconnection forced问题
- 写在Linux学习前
- word2003 /2007 添加无格式粘贴快捷键
- mysql无法启动,错误1067
- Sizzle选择器引擎解读
- 【HTML】教你怎么加快google-analytics的加载速度,ga.js的加载速度
- Eclipse自己定注释模板,不用每次自己敲上去