[SDOI2010]大陆争霸

题目链接
【分析】

• 有限制的单源最短路径
• 先考虑无限制时，如何求最短路
• Dijkstra的过程，就是每次扩展一个结点
• 类似的，加上题目中的限制条件后，求最短路即可
  注意：被结界限制的结点的 $dis$ 一定大于无限制的结点的 $dis$
  【代码】

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define LL long long
using namespace std;

const int N = 3e3 + 10;
const int M = 7e4 + 10;

int n, m;
struct edge { int v, w, nxt; } e[M];
int G[N], ed = 1, d[N], dis[N];
vector<int> c[N];
bool vis[N];

inline void add_edge(int u, int v, int w) {
  e[++ed] = (edge) { v, w, G[u] };
  G[u] = ed;
}

void Dijkstra() {
  memset(dis, 0x3f, sizeof(dis));
  dis[1] = 0;
  for (int k = 1; k <= n; ++k) {
    int u = 0;
    for (int i = 1; i <= n; ++i) {
      if (vis[i] || d[i] != 0) continue;
      if (dis[u] > dis[i]) u = i;
    }
    vis[u] = true; 
    for (int i = G[u]; i != 0; i = e[i].nxt) {
      int v = e[i].v, w = e[i].w;
      dis[v] = min(dis[v], dis[u] + w);
    }
    for (int i = 0; i < static_cast<int>(c[u].size()); ++i) {
      int v = c[u][i];
      --d[v];
      dis[v] = max(dis[v], dis[u]);
    }
  }
}

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add_edge(u, v, w);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &d[i]);
    for (int j = 1; j <= d[i]; ++j) {
      int v; scanf("%d", &v);
      c[v].push_back(i);
    }
  }
  Dijkstra();
  printf("%d\n", dis[n]);
  return 0;
}