Codeforces839C Journey
来源:互联网 发布:游戏客户端制作软件 编辑:程序博客网 时间:2024/06/05 03:06
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.
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.
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 .
41 21 32 4
1.500000000000000
51 21 33 42 5
2.000000000000000
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.
————————————————————————————————————
题目的意思是是给出一棵树,权值均为1,从1号点出发,遇到岔路走每个路的概率相等
不能走回头路,问走路长度的期望
思路:期望等于每个叶子节点走到的路程*走到这个点的概率,dfs维护长度和概率
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;#define mod 10000007#define mem(a,b) memset(a,b,sizeof a)struct node{ int u,v,next;} tree[200005];int s[100005],vis[100005],cnt,ct;double sum;void init(){ mem(s,-1); cnt=0; mem(vis,0);}void add(int u,int v){ tree[cnt].u=u; tree[cnt].v=v; tree[cnt].next=s[u]; s[u]=cnt++; tree[cnt].u=v; tree[cnt].v=u; tree[cnt].next=s[v]; s[v]=cnt++;}void dfs(int x,int sm,int fa,double p){ int k=0; for(int i=s[x]; ~i; i=tree[i].next) { if(tree[i].v==fa) continue; k++; } if(k==0) { sum+=sm*p; return; } for(int i=s[x]; ~i; i=tree[i].next) { if(!vis[tree[i].v]) { vis[tree[i].v]=1; dfs(tree[i].v,sm+1,x,p/k); } }}int main(){ int n,u,v; while(~scanf("%d",&n)) { init(); if(n==1) { printf("0.0000000000\n"); continue; } for(int i=1; i<n; i++) { scanf("%d%d",&u,&v); add(u,v); } vis[1]=1; sum=0; ct=0; dfs(1,0,-1,1); printf("%.10f\n",sum); } return 0;}
- Codeforces839C Journey
- codeforces839C Journey(DFS)
- Codeforces839C(dfs)
- Journey
- journey beginning
- Tomorrow journey
- Journey Start
- Journey(CDOJ1655)
- UESTC Journey
- Journey Project
- CF374 Journey
- C. Journey
- [CF721C]Journey
- C. Journey
- Happiness Is A Journey
- A new journey begin
- POJ_2488_A Knight's Journey
- Life's Journey
- css元素定位与浮动
- @RequestMapping 用法详解之地址映射
- CodeForces 182E Wooden Fence
- mybatis之一对一映射查询(十)
- POJ
- Codeforces839C Journey
- HTML:表单
- 递归与动态规划---最长公共子序列问题
- 一个简单的web点名程序(基于javascript)
- Java菜鸟教程 面向对象初步(一)
- python 百度地图 经纬度转地址
- Pygame初试----Cells
- idea创建maven项目整合SSH
- CodeForces