Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- #define N 101
- vector <int> mas[N];
- vector <int> res;
- int n;
- void dfs(int start ,int finish) {
- for (int i = 0; i < n ; i++) {
- if(mas[start][i] != -1 ) res.push_back(mas[start][i]);
- cout << "start " << start;
- if (res[i] != 0 && mas[start][i] > 0 && res[i] > mas[start][i]) {
- res[i] = mas[start][i];
- dfs(i, finish);
- }
- }
- }
- int main() {
- int start, finish;
- cin >> n >> start >> finish;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- int x;
- cin >> x;
- mas[i].push_back(x);
- }
- }
- dfs(start, finish);
- int way = 0;
- for (int i = 0; i < n; i++) way += res[i];
- if(way != 0) cout << way;
- else cout << "-1";
- return 0;
Add Comment
Please, Sign In to add comment