#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int MAXN = 4 * 1e2 + 5, INF = 0x3f3f3f3f; long long d[MAXN][MAXN]; bool vis[MAXN]; int n; void floyd_warshall(int x) { if (vis[x]) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (d[i][x] != INF && d[x][j] != INF) { d[i][j] = min(d[i][j], d[i][x] + d[x][j]); } } } } } signed main() { ios_base::sync_with_stdio(false); // Fast input int m; cin >> n >> m; // memset(d, 0x3f, sizeof(d)); // Initialize the distance matrix to infinity for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (i == j) d[i][j] = 0; else d[i][j] = INF; } vis[i] = 0; } for (int i = 1; i <= m; i++) { int u, v, w; cin >> u >> v >> w; d[u][v] = d[v][u] = w; } int q; cin >> q; while (q--) { short int type; cin >> type; if (type == 1) { int x; cin >> x; vis[x] = 1; floyd_warshall(x); } else { int x, y; cin >> x >> y; cout << ((!vis[x] || !vis[y] || d[x][y] == INF) ? -1 : d[x][y]) << endl; } } return 0; }

JingxiPan