Bzoj - 1415 聪聪可可 [概率][记忆化搜索]

用f[i][j]表示从聪聪在 i ， 可可在 j 时的期望步数
用to[i][j]表示从聪聪在 i ， 可可在 j 时聪聪的下一步，用Spfa预处理
然后对于每个位置 x -> y tmp 为走两步后的位置
f[x][y] = (f[tmp][y] + f[tmp][v]) / (y点的度数 + 1) （v为所有与y相邻的点）+ 1

#include <bits/stdc++.h>
#define y first
#define nxt second
#define mp make_pair
using namespace std;

const int N = 1005;

int n, m, st, ed, head[N], top, to[N][N], dg[N];

pair< int, int > e[N << 1];

void Adde( int x, int y )
{
    e[++top] = mp(y, head[x]), head[x] = top; dg[x]++;
    e[++top] = mp(x, head[y]), head[y] = top; dg[y]++;
}

int drop[N], que[N << 4], h, t, vis[N], dis[N];
double f[N][N];

void Spfa( int st )
{
    h = t = 0;
    memset(dis, 0x3f3f3f3f, sizeof(int) * (n + 2));
    memset(vis, 0, sizeof(int) * (n + 2));
    que[++t] = st;
    drop[st] = 0;
    dis[st] = 0;
    vis[st] = 1;
    while(h < t)
    {
        int u = que[++h];
        for(int i = head[u]; i; i = e[i].nxt)
        {
            int v = e[i].y;
            if(dis[v] > dis[u] + 1 || (dis[v] == dis[u] + 1 && u < drop[v]))
            {
                drop[v] = u;
                dis[v] = dis[u] + 1;
                if(!vis[v])
                {
                    vis[v] = 1;
                    que[++t] = v;
                }
            }
        }
        vis[u] = 0;
    }
    for(int i = 1; i <= n; ++i)
        if(i != st) to[st][i] = drop[i];
}

double Dfs( int x, int y )
{
    if(x == y) return f[x][y] = 0;
    if(to[y][x] == y || to[y][to[y][x]] == y) return f[x][y] = 1;
    if(f[x][y] > (-1e-7)) return f[x][y];
    double ans = 1;
    int tmp = to[y][to[y][x]];
    for(int i = head[y]; i; i = e[i].nxt)
    {
        int v = e[i].y;
        ans += Dfs(tmp, v) / (dg[y] + 1.0);
    }
    ans += Dfs(tmp, y) / (dg[y] + 1.0);
    return f[x][y] = ans;
}

int main()
{
    scanf( "%d%d%d%d", &n, &m, &st, &ed );
    for(int i = 1, u, v; i <= m; ++i)
        scanf( "%d%d", &u, &v ), Adde(u, v);
    for(int i = 1; i <= n; ++i) Spfa(i);
    memset(f, 0xc2, sizeof(f));
    printf( "%.3lf\n", Dfs(st, ed) );
    return 0;
}