CF--Journey--DFS+概率期望

C. Journey

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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

Copy

4
1 2
1 3
2 4

output

Copy

1.500000000000000

input

Copy

5
1 2
1 3
3 4
2 5

output

Copy

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.

 

N个点，n-1条边，任意一条边可以通达其他所有边。求出从1到遍历到不能继续往下走期望路径值。每个点等可能概率选择走或不走。

思路：DFS的时候记录概率以及路径值。

细节：DFS尽头是度为1的点且不等于1。其它方法也行。

每次选择的概率是x点往下走的路径数的倒数。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=100000+66;
const ll mod=1e9+7;
int n,m;
vector<int>g[maxn];
int vis[maxn];
int du[maxn];
double ans=0.0;
int fa;
void dfs(int x,double p,double s)
{
    if(du[x]==1&&x!=1)
    {
        ans=ans+(double)s*p;
        return ;
    }
    int k=0;
    for(int i=0; i<g[x].size(); i++)
    {
        int v=g[x][i];
        if(vis[v])
            continue;
        k++;
    }
    for(int i=0; i<g[x].size(); i++)
    {
        int v=g[x][i];
        if(vis[v])
            continue;
        vis[v]=1;
        dfs(v,p*(1.0*1.0/k),s+1);
        vis[v]=0;
    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1; i<n; i++)
    {
        int u,v;
        scanf("%d %d",&u,&v);
        du[u]++;
        du[v]++;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vis[1]=1;
    dfs(1,1.0,0);
    printf("%.12f",ans);
    return 0;
}

邻接表写法：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=100000+66;
const ll mod=1e9+7;
struct node
{
    int from;
    int to;
    int next;
}edge[maxn*2];
int num=0;
int head[maxn];
int n;
double ans;
void init()
{
    num=0;
    memset(head,-1,sizeof(head));
}
void add(int from,int to)
{
    edge[num].from=from;
    edge[num].to=to;
    edge[num].next=head[from];
    head[from]=num++;
}
void dfs(int u,int fa,double s,double p)
{
    int flag=1;
    int cnt=0;
    for(int k=head[u];k!=-1;k=edge[k].next)
    {
        int to=edge[k].to;
        if(to==fa)continue;//邻接表写法
        cnt++;
    }
    for(int k=head[u];k!=-1;k=edge[k].next)
    {
        int to=edge[k].to;
        if(to==fa)continue;
        flag=0;
        dfs(to,u,s+1.0,p*1.0/cnt);
    }
    if(flag)
    {
        ans+=p*s;//此时边界是某个点的上一个只有fa一个，即可判断边界问题。
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    init();
    for(int i=1;i<n;i++)
    {
        int u,v;
        scanf("%d %d",&u,&v);
        add(u,v);
        add(v,u);
    }
    ans=0.0;
    dfs(1,-1,0,1);
    printf("%.10lf",ans);
}