Link
Difficulty
算法难度4,思维难度5,代码难度4
Description
给定一棵树,每个点有直接充电的概率,每条边有传递充电的概率
求被充电的点的个数的期望值
1 ≤ n ≤ 5 × 1 0 5 1\le n\le 5\times 10^5 1≤n≤5×105
Solution
换根dp裸题咯
定义 d p x dp_x dpx代表点 x x x充不上点的概率, a n s = n − ∑ d p i ans=n-\sum dp_i ans=n−∑dpi
转移方程: d p x = ( 1 − p x ) × ∏ u ∈ s o n ( x ) ( 1 − v a l i + v a l i × d p u ) dp_x=(1-p_x)\times\prod_{u\in son(x)}(1-val_i+val_i\times dp_u) dpx=(1−px)×∏u∈son(x)(1−vali+vali×dpu)
换根的式子直接从dp转移方程就能看出来的
听说卡精度?我没什么感觉。
时间复杂度 O ( n ) O(n) O(n)
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cstring>
#define LL long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=' ';
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return f==1?x:-x;
}
const int N=1e6+5;
int n,tot;
int head[N],to[N],Next[N];
double ans,val[N],p[N],dp[N];
inline void addedge(int x,int y,double c){
to[++tot]=y;
Next[tot]=head[x];
head[x]=tot;
val[tot]=c;
}
inline void dfs(int x,int fa){
dp[x]=1.0-p[x];
for(int i=head[x];i;i=Next[i]){
int u=to[i];
if(u==fa)continue;
dfs(u,x);
dp[x]*=1.0-val[i]+val[i]*dp[u];
}
}
inline void dfs2(int x,int fa){
ans+=1.0-dp[x];
for(int i=head[x];i;i=Next[i]){
int u=to[i];
if(u==fa)continue;
dp[x]/=1.0-val[i]+val[i]*dp[u];
dp[u]*=1.0-val[i]+val[i]*dp[x];
dfs2(u,x);
dp[u]/=1.0-val[i]+val[i]*dp[x];
dp[x]*=1.0-val[i]+val[i]*dp[u];
}
}
int main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read(),c=read();
double l=(double)c/100.0;
addedge(x,y,l);addedge(y,x,l);
}
for(int i=1;i<=n;++i){
int c=read();
p[i]=(double)c/100.0;
}
dfs(1,0);
dfs2(1,0);
printf("%.6lf\n",ans);
return 0;
}