Advertisement
Guest User

Floid

a guest
Feb 21st, 2019
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. const int inf = 1e9 + 10;
  6.  
  7. int main()
  8. {
  9. int n, s, t;
  10.  
  11. cin >> n >> s >> t;
  12. s--; t--;
  13.  
  14. int d[n][n];
  15.  
  16. for (int i = 0; i < n ;i++)
  17. for (int j = 0; j < n ;j++)
  18. {
  19. cin >> d[i][j];
  20.  
  21. if (d[i][j] < 0)
  22. d[i][j] = inf;
  23. }
  24.  
  25. for (int k = 0; k < n ;k++)
  26. for (int i = 0; i < n ;i++)
  27. for (int j = 0; j < n ;j++)
  28. d[i][j] = min (d[i][j], d[i][k] + d[k][j]);
  29.  
  30. if (d[s][t] < inf)
  31. {
  32. cout << d[s][t];
  33.  
  34. return 0;
  35. }
  36. else
  37. {
  38. cout << -1;
  39.  
  40. return 0;
  41. }
  42.  
  43. return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement