HDOJ 1874

来源：互联网发布：情义我心知的演员编辑：程序博客网时间：2024/05/22 00:23

// 单源最短路径

#include <iostream>#define MAXN 205using namespace std;long map[MAXN][MAXN], dis[MAXN], pre[MAXN], vis[MAXN];void dijkstra(const int &s, const int &n){memset(dis, 0x3f, sizeof(dis));for (int i = 1; i <= n; ++i)if (map[s][i] != -1) dis[i] = map[s][i];dis[s] = 0; vis[s] = 1;for (int i = 2; i <= n; ++i){int u = n;for (int j = 1; j <= n; ++j)if (!vis[j] && dis[j] < dis[u]) u = j;vis[u] = 1;for (int j = 1; j <= n; ++j)if (!vis[j] && map[u][j] != -1 && dis[j] > dis[u] + map[u][j]) dis[j] = dis[u] + map[u][j];}}int main(){int n, m, x, y, tmp;while (cin >> n >> m){for (int i = 0; i <= n; ++i) for (int j = 0; j <= n; ++j) map[i][j] = -1;for (int i = 0; i < m; ++i){cin >> x >> y >> tmp; if (map[++x][++y] != -1) {if (map[x][y] > tmp) map[x][y] = map[y][x] = tmp;} else map[x][y] = map[y][x] = tmp;}cin >> x >> y;dijkstra(x + 1, n);if (dis[y + 1] < 10010) cout << dis[y + 1] << endl;else cout << "-1" << endl;}return 0;}

好吧，本题略坑，以上代码是过不掉的，原因不明，如有知道的，欢迎hack