Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <iostream>
- #include <stdio.h>
- #include <vector>
- #include <string>
- #include <algorithm>
- #include <queue>
- #include <map>
- #include <set>
- using namespace std;
- const int INF = 10000000;
- int main()
- {
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- int n, ch, m, s, f;
- cin >> n >> s >> f;
- int dist[10000];
- for (int i = 0; i <= 10000; i++) {
- dist[i] = INF;
- }
- vector < vector< pair <int, int> > > v;
- dist[s] = 0;
- vector <bool> used (n);
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- cin >> ch;
- v[i].push_back(make_pair(j, ch));
- }
- }
- for (int i = 0; i < n; i++) {
- int now = -1;
- for (int j = 0; j < n; j++) {
- if (!used[j] && (now == -1 || dist[j] < dist[now])) {
- now = j;
- }
- }
- if (dist[now] == INF) {
- break;
- }
- used[now] = true;
- for (int j = 0; j < v[now].size(); j++) {
- int to = v[now][j].first;
- int how = v[now][j].second;
- if (dist[now] + how < dist[to]) {
- dist[to] = dist[now] + how;
- }
- }
- }
- cout << dist[f];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement