【Codeforces 839 C. Journey】& dfs
2017-08-16 16:16
489 查看
C. Journey
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.
Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings them. When the horse reaches a city (including the first one), it goes to one of the cities connected to the current city. But it is a strange horse, it only goes to cities in which they weren’t before. In each such city, the horse goes with equal probabilities and it stops when there are no such cities.
Let the length of each road be 1. The journey starts in the city 1. What is the expected length (expected value of length) of their journey? You can read about expected (average) value by the link https://en.wikipedia.org/wiki/Expected_value.
Input
The first line contains a single integer n (1 ≤ n ≤ 100000) — number of cities.
Then n - 1 lines follow. The i-th line of these lines contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the cities connected by the i-th road.
It is guaranteed that one can reach any city from any other by the roads.
Output
Print a number — the expected length of their journey. The journey starts in the city 1.
Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .
Examples
input
4
1 2
1 3
2 4
output
1.500000000000000
input
5
1 2
1 3
3 4
2 5
output
2.000000000000000
Note
In the first sample, their journey may end in cities 3 or 4 with equal probability. The distance to city 3 is 1 and to city 4 is 2, so the expected length is 1.5.
In the second sample, their journey may end in city 4 or 5. The distance to the both cities is 2, so the expected length is 2.
思路 : 遇到叶子节点便求下路程期望
AC代码:
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.
Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings them. When the horse reaches a city (including the first one), it goes to one of the cities connected to the current city. But it is a strange horse, it only goes to cities in which they weren’t before. In each such city, the horse goes with equal probabilities and it stops when there are no such cities.
Let the length of each road be 1. The journey starts in the city 1. What is the expected length (expected value of length) of their journey? You can read about expected (average) value by the link https://en.wikipedia.org/wiki/Expected_value.
Input
The first line contains a single integer n (1 ≤ n ≤ 100000) — number of cities.
Then n - 1 lines follow. The i-th line of these lines contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the cities connected by the i-th road.
It is guaranteed that one can reach any city from any other by the roads.
Output
Print a number — the expected length of their journey. The journey starts in the city 1.
Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .
Examples
input
4
1 2
1 3
2 4
output
1.500000000000000
input
5
1 2
1 3
3 4
2 5
output
2.000000000000000
Note
In the first sample, their journey may end in cities 3 or 4 with equal probability. The distance to city 3 is 1 and to city 4 is 2, so the expected length is 1.5.
In the second sample, their journey may end in city 4 or 5. The distance to the both cities is 2, so the expected length is 2.
思路 : 遇到叶子节点便求下路程期望
AC代码:
#include<cstdio> #include<cmath> #include<vector> #include<algorithm> using namespace std; const int MAX = 1e5 + 10; typedef long long LL; vector <int> v[MAX]; double ans; void dfs(int a,int f,int nl,double w){ int o = 0; for(int i = 0; i < v[a].size(); i++) if(v[a][i] != f) o++; for(int i = 0; i < v[a].size(); i++) if(v[a][i] != f) dfs(v[a][i],a,nl + 1,w / o); if(!o) ans += w * nl; } int main() { int n,a,b; scanf("%d",&n); for(int i = 1; i < n; i++) scanf("%d %d",&a,&b),v[a].push_back(b),v[b].push_back(a); ans = 0,dfs(1,-1,0,1); printf("%.8f\n",ans); return 0; }
相关文章推荐
- codeforces 839 C. Journey【DFS + 期望】
- codeforces 638B - Making Genome in Berland (STL&&DFS)
- [Codeforces 258B & 259 D]Little Elephant and Elections 数位dp+dfs
- poj 2488 A Knight's Journey DFS
- A Knight's Journey+dFS
- 【codeforces 721C】【DAG 按照拓扑排序记忆化DFS】C. Journey 【DAG图,5000个点,5000条边 让你求从1到n的路径长度不超过T中经过点数最多的一条 】
- CodeForces 9C Hexadecimal's Numbers(DFS)
- A Knight's Journey poj DFS
- CodeForces 611B New Year and Old Property【DFS&&模拟位运算】
- codeforces 839 C Journey
- codeforces 852I Dating(DFS序,LCA,莫队)
- CF->CodeForces 137C
- 【dfs && 剪枝】SPOJ FISHER Fishmonger
- Codeforces Round #428 (Div. 2) C. Journey(dfs deep
- 【CodeForces】510C - Fox And Names(拓扑 & STL)
- codeforces#428(div2)C Journey(树上的dfs水题)
- Codeforces 761E Dasha and Puzzle【构造,树dfs】
- Codeforces 430C Xor-tree【Dfs+思维】
- Codeforces 580C Kefa and Park【dfs】水题
- C. Journey(dfs求期望+Codeforces Round #428 (Div. 2))