acwing算法题--铁路与公路

原题链接：https://www.acwing.com/problem/content/description/4077/

#include <iostream>
#include <vector>
#include <cstring>using namespace std;const int N = 410, INF = 0x3f3f3f3f;int n, m;
int railway[N][N], highway[N][N];int floyd(int path[][N]) {if (path[1][n] == 1) return 1;for (int k = 1; k <= n; k ++ ) {for (int i = 1; i <= n; i ++ ) {for (int j = 1; j <= n; j ++ ) {path[i][j] = min(path[i][j], path[i][k] + path[k][j]);}}}return path[1][n];
}int main() {scanf("%d%d", &n, &m);memset(railway, 0x3f, sizeof(railway));memset(highway, 0x3f, sizeof(highway));for (int i = 0; i < m; i ++ ) {int a, b;cin >> a >> b;railway[a][b] = railway[b][a] = 1;}for (int i = 1; i <= n; i ++ ) {for (int j = 1; j <= n; j ++ ) {if (i != j && railway[i][j] != 1) {highway[i][j] = highway[j][i] = 1;} }}int a = floyd(railway), b = floyd(highway);int res = max(a, b);if (res == INF) res = -1;cout << res;return 0;
}

acwing算法题--铁路与公路相关推荐

AcWing算法题常用代码模板
一.基础算法 1.常用代码模板快速排序算法模板 -- 模板题 AcWing 785. 快速排序算法步骤: ①确定分界点 ②调整区间 ③递归处理左右两段 Tips: ①如果输入数据量 ...
acwing算法题--看图做题
原题链接:https://www.acwing.com/problem/content/3992/ 找规律题 #include<iostream>using namespace std;i ...
acwing算法题--不同的数
原题链接:https://www.acwing.com/problem/content/3991/ #include <iostream> #include <unordered_m ...
acwing算法题--二维费用的背包问题
原题链接:https://www.acwing.com/problem/content/8/ #include <iostream>using namespace std;const in ...
acwing算法题--混合背包问题
原题链接:https://www.acwing.com/problem/content/7/ #include <iostream> #include <vector>usin ...
acwing算法题--多重背包问题二
原题链接:https://www.acwing.com/problem/content/5/ #include <iostream> #include <vector>usin ...
acwing算法题--多重背包问题一
原题链接:https://www.acwing.com/problem/content/4/ package mainimport "fmt"const N = 1010var d ...
acwing算法题--完全背包问题
原题链接:https://www.acwing.com/problem/content/3/ package mainimport "fmt" const N = 1010 var ...
acwing算法题--01背包问题
原题链接:https://www.acwing.com/problem/content/2/ 使用动态规划 package mainimport "fmt"const N = 10 ...

acwing算法题--铁路与公路

acwing算法题--铁路与公路相关推荐

最新文章

热门文章