luogu P4316 绿豆蛙的归宿

analysis

$$E=\sum _{A\in S}\prod _{j\in A}{P}_j\times \sum _{k\in A}{W}_k$$

$$(S为所有1到n路径方案的集合,A为一种方案包含的边的集合,P_i为走过i边的概率)$$

所以dfs算出每个点的概率和距离最后累加就好了啊

code

#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define ll long long
template<typename T>void read(T &x){
	x=0;char r=getchar();T neg=1;
	while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
	while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
	x*=neg;
}
const int maxn=100000+10,maxm=(100000+10)<<1;
int n,m;
struct node{
	int e;
	ll w;
	int nxt;
}edge[maxm];
int cnt=0;
int head[maxn];
inline void addl(int u,int v,ll w){
	edge[cnt].e=v;
	edge[cnt].w=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt++;
}
double p[maxn];
double dis[maxn];
int out[maxn];
double res=0;
void dfs(int u){
	for(int i=head[u];i!=-1;i=edge[i].nxt){
		int v=edge[i].e;
		p[v]=p[u]*(1.0/out[u]);
		dis[v]=dis[u]+1.0*edge[i].w;
		if(v==n){
			res+=p[v]*1.0*dis[v];
			return;
		}
		else dfs(v);
	}
}
int main(){
	#ifndef ONLINE_JUDGE
	freopen("datain.txt","r",stdin);
	#endif
	clean(head,-1);
	clean(p,0);
	clean(dis,0);
	clean(out,0);
	p[1]=1;
	read(n);read(m);
	loop(i,1,m){
		int ui,vi;
		ll w;
		read(ui);read(vi);
		read(w);
		addl(ui,vi,w);
		++out[ui];
	}
	dfs(1);
	printf("%.2lf\n",res);
	return 0;
}