51nod1649 齐头并进 (思维,最短路)
2018-03-12 20:05
253 查看
原题链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1649
思路:因为所有没有地铁的地方都有公路,也就是说公交车和火车其中的某一个都可以一小时到达,我们只需要求另一个的最短路即可,实现上用邻接矩阵方便一点
AC代码:#include<bits/stdc++.h>
using namespace std;
const int MAXN = 405;
const int INF = 0x3f3f3f3f;
int n, m, u, v;
int cnt, head[MAXN], mp[MAXN][MAXN], d[MAXN];
bool vis[MAXN];
void dijkstra() {
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++)d[i] = INF;
d[1] = 0;
for (int i = 0; i < n; i++) {
int m = INF, x = -1;
for (int y = 1; y <= n; y++)if (!vis[y] && d[y] < m)m = d[x = y];
if (x == -1)continue;
vis[x] = true;
for (int y = 1; y <= n; y++) {
if (mp[x][y] == 1 && d[y] > d[x] + mp[x][y]) {
d[y] = d[x] + mp[x][y];
}
}
}
}
int main() {
scanf("%d %d", &n, &m);
memset(mp, -1, sizeof(mp));
for (int i = 1; i <= n; i++) {
mp[i][i] = 0;
}
for (int i = 0; i < m; i++) {
scanf("%d %d", &u, &v);
mp[u][v] = mp[v][u] = 1;
}
if (mp[1]
== 1) {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
mp[i][j] = -mp[i][j];
mp[j][i] = -mp[j][i];
}
}
}
dijkstra();
printf("%d\n", d
== INF ? -1 : d
);
return 0;
}
思路:因为所有没有地铁的地方都有公路,也就是说公交车和火车其中的某一个都可以一小时到达,我们只需要求另一个的最短路即可,实现上用邻接矩阵方便一点
AC代码:#include<bits/stdc++.h>
using namespace std;
const int MAXN = 405;
const int INF = 0x3f3f3f3f;
int n, m, u, v;
int cnt, head[MAXN], mp[MAXN][MAXN], d[MAXN];
bool vis[MAXN];
void dijkstra() {
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++)d[i] = INF;
d[1] = 0;
for (int i = 0; i < n; i++) {
int m = INF, x = -1;
for (int y = 1; y <= n; y++)if (!vis[y] && d[y] < m)m = d[x = y];
if (x == -1)continue;
vis[x] = true;
for (int y = 1; y <= n; y++) {
if (mp[x][y] == 1 && d[y] > d[x] + mp[x][y]) {
d[y] = d[x] + mp[x][y];
}
}
}
}
int main() {
scanf("%d %d", &n, &m);
memset(mp, -1, sizeof(mp));
for (int i = 1; i <= n; i++) {
mp[i][i] = 0;
}
for (int i = 0; i < m; i++) {
scanf("%d %d", &u, &v);
mp[u][v] = mp[v][u] = 1;
}
if (mp[1]
== 1) {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
mp[i][j] = -mp[i][j];
mp[j][i] = -mp[j][i];
}
}
}
dijkstra();
printf("%d\n", d
== INF ? -1 : d
);
return 0;
}
相关文章推荐
- 51nod1649- 齐头并进-最短路
- 51nod1649-二维最短路|(补图&最短路)-齐头并进
- HDU3631 - Shortest Path - floyd最短路+思维
- POJ 1797 Heavy Transportation 【最短路思维+最大承载】
- Codeforces--333C--The Two Routes(最短路弗洛伊德)(思维)
- POJ1797 - Heavy Transportation - 条件最短路+思维/二分
- HDU 6166 Senior Pan (思维枚举+最短路 求最近点对)
- POJ3660 - Cow Contest - 关系传递闭包(最短路变形)+思维
- FZU/FOJ 2243 Daxia like uber【最短路SPFA+思维】
- HDU6071-Lazy Running 最短路+思维
- Gym 100935 Weird Maze 【预处理最短路 + 思维】
- HDU 3873 Invade the Mars 【思维好题 + 最短路】
- Hdu 4370 0 or 1【思维建图+最短路】好题!好题!好题!
- arc084_b (思维+最短路)(好题)
- CSU 1808 地铁【思维建图+最短路Dij+Heap】
- POJ 2502 【思维是朴素的最短路 卡输入和建图】
- “师创杯”山东理工大学第九届ACM程序设计竞赛 热身赛 D.疯狂的bLue【思维+DAG图上的最短路】
- 2017 计蒜之道 复赛 百度地图导航【思维+最短路】
- 河南多校大一训练赛 <思维--DP--背包--最短路--最大生成树>
- hdu 5876 Sparse Graph【最短路+思维】好题