Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- const int INF = 1e9;
- int main() {
- int N, S, F;
- cin >> N >> S >> F;
- S--;
- F--; // Преобразуем в 0-индексацию
- vector<vector<int>> graph(N, vector<int>(N));
- for (int i = 0; i < N; ++i) {
- for (int j = 0; j < N; ++j) {
- cin >> graph[i][j];
- }
- }
- vector<int> dist(N, INF);
- vector<int> prev(N, -1);
- vector<bool> visited(N, false);
- dist[S] = 0;
- for (int i = 0; i < N; ++i) {
- int u = -1;
- for (int j = 0; j < N; ++j) {
- if (!visited[j] && (u == -1 || dist[j] < dist[u])) {
- u = j;
- }
- }
- if (dist[u] == INF)
- break;
- visited[u] = true;
- for (int v = 0; v < N; ++v) {
- if (graph[u][v] != -1 && dist[u] + graph[u][v] < dist[v]) {
- dist[v] = dist[u] + graph[u][v];
- prev[v] = u;
- }
- }
- }
- if (dist[F] == INF) {
- cout << -1 << endl;
- }
- else {
- vector<int> path;
- for (int v = F; v != -1; v = prev[v]) {
- path.push_back(v);
- }
- reverse(path.begin(), path.end());
- for (int v : path) {
- cout << v + 1 << " "; // Возвращаемся к 1-индексации для вывода
- }
- cout << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
