Codeforces 839C Journey(dfs+概率)

很简单啦,注意到他只有n-1条边,那他一定是一棵树,没有环的.
所以只需要计算到达每个尽头的距离*每一次选路线时的概率就好了.

/*  xzppp  */
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <list>
#include <math.h>
#include <iomanip>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mp make_pair
typedef long long  LL;
typedef unsigned long long ULL;
const int MAXN = 100000;
const int  INF = 0x7fffffff;
const int MOD = 1e9+7;
vector<int > G[MAXN+17];
int num = 0;
double ans = 0;
bool vis[MAXN+17];
void dfs(int x,double chac,int dis)
{
    vis[x] = 1;
    double temp = 1.0;
    if(x!=0&&G[x].size()>1) temp = 1.0/(G[x].size()-1);
    if(x==0) 
    {
        temp = 1.0/(G[x].size());
    }
    //cout<<x<<"  "<<temp<<G[x].size()<<endl;
    for (int i = 0; i < G[x].size(); ++i)
    {
        if(!vis[G[x][i]])
            dfs(G[x][i],chac*temp,dis+1);
    }
    if(G[x].size()==1)
    {
        //cout<<chac<<endl;
        ans += chac*dis;
    }
    return;
}
int main()
{
    //FFF
    int n;
    cin>>n;
    for (int i = 0; i < n-1; ++i)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        u--;v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(0,1.0,0);
    cout<<fixed<<setprecision(15)<<ans<<endl;
    return 0;
}