hdu 5001 Walk 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
来源:互联网 发布:javascript视频百度云 编辑:程序博客网 时间:2024/05/14 05:45
Walk
Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 350 Accepted Submission(s): 228
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
Recommend
hujie | We have carefully selected several similar problems for you: 5017 5016 5015 5013 5012
题意:求走d步不经过i点的概率。
思路:这题题解是矩阵快速幂的做法,但是概率dp也可以,dp[d][i]表示走d步到达i点的概率,每次排除一点,求所有点的概率和就是不经过该点的概率。求概率这种东西一般就是变换思维,比赛的时候思路没绕过来,就想不明白怎么求概率。
#include <iostream>#include <stdio.h>#include <cmath>#include <cstring>#include <algorithm>#include <vector>using namespace std;const int mod=1e9+7;const int N=52;vector <int> vec[N];int t,n,m,d,a,b;double dp[10005][N],ans[N];void init(){ memset(ans,0,sizeof(ans)); memset(vec,0,sizeof(vec)); scanf("%d%d%d",&n,&m,&d); while(m--){ scanf("%d%d",&a,&b); vec[a].push_back(b); vec[b].push_back(a); }}void solve(){ for(int cas=1;cas<=n;cas++){ memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) dp[0][i]=1.0/n; dp[0][cas]=0; for(int i=1;i<=d;i++){ for(int j=1;j<=n;j++){ if(j==cas)continue; for(int k=0;k<vec[j].size();k++){ if(vec[j][k]==cas)continue; dp[i][j]+=dp[i-1][vec[j][k]]/vec[vec[j][k]].size(); } } } for(int i=1;i<=n;i++) ans[cas]+=dp[d][i]; } for(int i=1;i<=n;i++)printf("%.8lf\n",ans[i]);}int main(){ scanf("%d",&t); while(t--){ init(); solve(); } return 0;}
0 0
- hdu 5001 Walk 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- HDU 5001 Walk / 2014 ACM/ICPC Asia Regional Anshan Online
- HDU 5001 Walk 求从任意点出发任意走不经过某个点的概率 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- poj 5001 Walk &&2014 ACM/ICPC Asia Regional Anshan Online 1005(dp)
- HDU 5000 Clone / 2014 ACM/ICPC Asia Regional Anshan Online
- HDU 4998 Rotate / 2014 ACM/ICPC Asia Regional Anshan Online
- hdu 5000 Clone 2014 ACM/ICPC Asia Regional Anshan Online
- hdu 5000 Clone 2014 ACM/ICPC Asia Regional Anshan Online
- hdu 4998 Rotate 2014 ACM/ICPC Asia Regional Anshan Online
- 2014 ACM/ICPC Asia Regional Anshan Online
- HDU 5000 Clone 规律+dp 2014 ACM/ICPC Asia Regional Anshan Online
- 2014 ACM/ICPC Asia Regional Anshan Online HDU 4998 HDU 5000 HDU 5001 HDU 5003
- 2014 ACM/ICPC Asia Regional Anshan Online D Clone
- HDU4998 Rotate (2014 ACM/ICPC Asia Regional Anshan Online)
- hdu 5045 - Contest(2014 ACM/ICPC Asia Regional Shanghai Online )概率dp
- HDU 5003 Osu! 水题 2014 ACM/ICPC Asia Regional Anshan Online
- HDU 4998 Rotate 计算几何 2014 ACM/ICPC Asia Regional Anshan Online
- hdu 5003 Osu! 水题 2014 ACM/ICPC Asia Regional Anshan Online
- C++ primer 第五版 中文版 练习 10.36 个人code
- Discuz! 伪静态分析
- JBPM4 常用表结构及其说明
- 设计模式 之职链模式
- Solr源码导入Eclipse
- hdu 5001 Walk 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- java学习笔记(八) -- 递归
- Vault Professional
- nginx负载均衡压力测试(二)
- 中国·熙式 X·S蚕丝面膜指尖创造奇迹
- 中国·熙式 X·S蚕丝面膜指尖创造奇迹
- 从Java视角理解CPU上下文切换(Context Switch)
- git 的常规使用
- 选择好ADC中性能指标是设计系统运行良好的必备