[BZOJ3036]绿豆蛙的归宿 期望DP

[BZOJ3036]

• f[x]表示从x到n的期望路径长度，倒着按Topsort转移即可
• 正序转移的话每条边的概率不对，所以要倒序

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
const int N=1e6;
struct node{int y,n,v;}e[N];
int lin[N],out[N],du[N],len,n,m,x,y,v;
double f[N];
queue<int> q;
inline int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
inline void LK(int x,int y,int v)
{e[++len].y=y,e[len].v=v,e[len].n=lin[x],lin[x]=len;}
int main(){
	n=read(),m=read();
	rep(i,1,m){
		x=read(),y=read(),v=read();
		LK(y,x,v); out[x]++; du[x]++;
	}
	q.push(n);
	while(q.size()){
		int x=q.front();q.pop();
		for(int i=lin[x];i;i=e[i].n){
			int y=e[i].y;
			f[y]+=1.0*(f[x]+e[i].v)/out[y];
			du[y]--;
			if(!du[y])q.push(y);
		}
	}
	printf("%.2lf",f[1]);
	return 0;
}