d
i
s
[
i
]
[
j
]
dis[i][j]
dis[i][j]表示
i
i
i到
j
j
j的最短距离
i
d
[
i
]
[
j
]
id[i][j]
id[i][j]表示
i
i
i到
j
j
j的路径上
i
i
i下一个要去的点
f [ i ] [ j ] f[i][j] f[i][j]表示聪聪在 i i i号点,可可在 j j j号点,聪聪可以追上可可的时间期望
当
d
i
s
[
i
]
[
j
]
=
0
dis[i][j]=0
dis[i][j]=0时,
f
[
i
]
[
j
]
=
0
f[i][j]=0
f[i][j]=0
当
d
i
s
[
i
]
[
j
]
<
=
2
dis[i][j]<=2
dis[i][j]<=2时,
f
[
i
]
[
j
]
=
1
f[i][j]=1
f[i][j]=1
考虑聪聪:聪聪下一个到达的点是 n t = i d [ i d [ x ] [ y ] ] [ y ] nt=id[id[x][y]][y] nt=id[id[x][y]][y],
考虑聪聪:可可当前的点为 j j j,则接下来可以到达下一个的点为 k k k或者不动,对应的状态就是: f [ n t ] [ k ] f[nt][k] f[nt][k]或者 f [ n t ] [ j ] f[nt][j] f[nt][j]
设 p p p为与 j j j相连的点的个数,则所有情况的概率都 ( 1 p + 1 ) (\frac{1}{p+1}) (p+11)
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define db double
#define sg string
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define red(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;
const ll N=2e3+5;
const ll Inf=1e18;
db f[N][N];
ll n,m,st,ed,ans,deg[N],vis[N],id[N][N],dis[N][N];
ll cnt,to[N<<1],nxt[N<<1],edge[N<<1],head[N];
inline ll read() {
ll x=0;char ch=getchar();bool f=0;
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f?-x:x;
}
void ins(ll x,ll y,ll z) {
++cnt;to[cnt]=y;edge[cnt]=z;nxt[cnt]=head[x];head[x]=cnt;
}
void spfa(ll s) {
queue<ll>q;
rep(i,1,n) vis[i]=0,dis[s][i]=Inf;dis[s][s]=0;q.push(s);
while(q.size()) {
ll x=q.front();q.pop();
for(ll i=head[x];i;i=nxt[i]) {
ll y=to[i],z=edge[i];
if(dis[s][y]>dis[s][x]+z) {
dis[s][y]=dis[s][x]+z;
if(!vis[y]) {
q.push(y);vis[y]=1;
}
}
}
}
}
db dp(ll x,ll y) {
if(f[x][y]!=-1.0) return f[x][y];
if(dis[x][y]==0) return f[x][y]=0.0;
if(dis[x][y]<=2) return f[x][y]=1.0;
ll nt=id[id[x][y]][y];
f[x][y]=dp(nt,y);
for(ll i=head[y];i;i=nxt[i]) f[x][y]+=dp(nt,to[i]);
return f[x][y]=f[x][y]/(1.0+deg[y]*1.0)+1.0;
}
int main() {
n=read(),m=read();st=read(),ed=read();
rep(i,1,m) {
ll x=read(),y=read();
deg[x]++,deg[y]++;
ins(x,y,1),ins(y,x,1);
}
rep(i,1,n) rep(j,1,n) f[i][j]=-1.0;
rep(i,1,n) {
f[i][i]=0.0;
id[i][i]=i;spfa(i);
}
rep(i,1,n) rep(j,1,n) {
ll mn=Inf;
for(ll k=head[i];k;k=nxt[k]) if(dis[i][j]>dis[to[k]][j]) mn=min(mn,to[k]);
id[i][j]=mn;
}
printf("%.3lf",dp(st,ed));
return 0;
}