【P4316 】 绿豆蛙的归宿

P4316
其实这题也没管做法对不对 就写了一发就过了
因为他是每个节点都可以到终点 然后起点又是1
那么我们直接对1点bfs
然后因为要统计长度期望 我们可以知道这个点开始到下一个点的概率是 1/sz
如果我们把他放进队列的时候不断更新这个点的概率
那么对答案的累加就是 这个点概率 * 1/sz *len
然后没卡精度就过了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
vector<pair<int ,double> > G[MAX_N];
double ans = 0;
void bfs(int u,double now)
{
    queue<pair<int ,double> > q;
    q.push(make_pair(u,now));
    while(!q.empty())
    {
        pair<int,double > tmp = q.front();
        q.pop();
        int sz = G[tmp.first].size();
        for(int i = 0;i<sz;++i)
        {
            ans+=tmp.second*(1.0/sz)*G[tmp.first][i].second;
            q.push(make_pair(G[tmp.first][i].first,tmp.second*(1.0/sz)));
        }
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,x,y;
    double z;
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=m;++i)
    {
        scanf("%d%d%lf",&x,&y,&z);
        G[x].push_back(make_pair(y,z));
    }
    bfs(1,1.0);
    printf("%.2f\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}