zoukankan      html  css  js  c++  java
  • Codeforces Round #428 (Div. 2) C-Journey

    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 inputCopy 4 1 2 1 3 2 4 outputCopy 1.500000000000000 inputCopy 5 1 2 1 3 3 4 2 5 outputCopy 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.

    dfs就完事了,要注意到达每个终点节点的概率不同!

    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cstdio>
    #include<cmath>
    #include<map>
    #include<vector>
    #define pb push_back
    #define ll long long
    const int inf=0x3f3f3f3f;
    using namespace std;
    const int N=1e5+5;
    vector<int>vec[N];
    int an[N];
    double ans;
    int n,u,v;
    void dfs(int rt,int fa,int deep,double p)
    {
        bool flag=true;
        for(int i=0;i<vec[rt].size();i++)
        {
            int temp=vec[rt][i];
            if(temp==fa)
                continue;
            flag=false;
            if(fa==0)
                dfs(temp,rt,deep+1,p/(vec[rt].size()));
            else
                dfs(temp,rt,deep+1,p/(vec[rt].size()-1));
        }
        if(flag)
        {
            ans+=deep*p;
            //printf("%d %.15f
    ",deep,ans);
        }
    }
    int main()
    {
        scanf("%d",&n);
        for(int i=1;i<n;i++)
        {
            scanf("%d%d",&u,&v);
            vec[u].pb(v);
            vec[v].pb(u);
        }
        dfs(1,0,0,1);
        printf("%.15f
    ",ans);
        return 0;
    }
    View Code
  • 相关阅读:
    python(三):python自动化测试定位
    python(二):用python抓取指定网页
    python(一):介绍网络爬虫
    oracle批量增加数据
    oracle数据库基本操作
    web安全测试要点
    linux下安装jdk、tomcat
    在linux上编译C
    linux基本操作
    对首次性能测试的总结与思考
  • 原文地址:https://www.cnblogs.com/switch-waht/p/12209197.html
Copyright © 2011-2022 走看看