2014鞍山网络预选赛1005(概率DP)hdu5001
2014-09-14 02:22
435 查看
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
2 5 10 100 1 2 2 3 3 4 4 5 1 5 2 4 3 5 2 5 1 4 1 3 10 10 10 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 4 9
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
相关文章推荐
- 【概率dp,难度3颗星】hdu-5001(2014鞍山网络赛)
- 2014牡丹江网络预选赛I题(字符串hash+简单DP)zoj3817
- 2014鞍山网络预选赛1010(缩点+高斯消元)hdu5006
- HDU -- 5001 Walk(2014鞍山网络赛E)(概率)
- Hdu 4035 Maze (dp求期望) - 2011 ACM/ICPC 成都赛区网络预选赛 1005
- HDU 5045 Contest(概率dp,状态压缩,2014上海网络赛1004)
- 2014鞍山网络预选赛1006(LCT模板题)hdu5002
- 2014鞍山网络预选赛1004(贪心)hdu5000
- 2014鞍山ACM网络赛 HDU5001 Walk
- 20140930 【 DP - 状态压缩 】 2014-上海区域赛-网络预选赛 hdoj 5045 Contest
- 2014牡丹江网络预选赛D题(状压DP)zoj3812
- 2014 鞍山网络赛 hdu 5003 Osu!
- 2014 ACM-ICPC亚洲区域赛牡丹江站网络预选赛 C Untrusted Patrol
- 2014牡丹江网络预选赛F题(隐式图BFS暴搜)zoj3814
- HDU 5001 Walk 求从任意点出发任意走不经过某个点的概率 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- ZOJ 3818 The Himalayas (2014 ACM/ICPC 牡丹江站 网络预选赛 J 题)
- 2014 Super Training #1 F Passage 概率DP
- Rotate+hud+2014鞍山网络赛
- hdu 4901 The Romantic Hero(计数dp)2014多校训练第4场1005
- 2014多校第七场1005 || HDU 4939 Stupid Tower Defense (DP)