【Leetcode】1514. Path with Maximum Probability

题目地址：

https://leetcode.com/problems/path-with-maximum-probability/

给定一个无向图，再给定每个边的边权，边$x\to y$的边权代表信号从$x$到$y$传输成功的概率。再给定起点和终点，问从起点到终点的所有路径中，传输成功概率最大的路径，成功概率是多少。

思路是Dijkstra算法，可以加堆优化。如果将每个边权取对数再取相反数，则转化为求最短路，所以可以用Dijkstra算法来做。代码如下：

class Solution {
 public:
  using PDI = pair<double, int>;
  double maxProbability(int n, vector<vector<int>>& es, vector<double>& prob,
                        int st, int ed) {
    int m = es.size();
    vector<int> h(n, -1), e(m << 1), ne(m << 1);
    vector<double> w(m << 1);
    int idx = 0;
#define add(a, b, c) e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++
    for (int i = 0; i < m; i++) {
      int u = es[i][0], v = es[i][1];
      double pr = prob[i];
      add(u, v, pr), add(v, u, pr);
    }
    priority_queue<PDI> heap;
    heap.push({1.0, st});
    vector<bool> vis(n);
    vector<double> dist(n, 0.0);
    while (heap.size()) {
      auto [pr, u] = heap.top();
      heap.pop();
      if (u == ed) return pr;
      if (vis[u]) continue;
      vis[u] = true;
      dist[u] = pr;
      for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        double p = w[i];
        if (!vis[v] && dist[v] < dist[u] * p) {
          dist[v] = dist[u] * p;
          heap.push({dist[v], v});
        }
      }
    }

    return 0.0;
  }
};

时间复杂度$O(m\log n)$，空间$O(m+n)$，$n$和$m$分别是点数和边数。