试题编号: | 201712-4 |
试题名称: | 行车路线 |
时间限制: | 1.0s |
内存限制: | 256.0MB |
问题描述: | 问题描述 小明和小芳出去乡村玩,小明负责开车,小芳来导航。 输入格式 输入的第一行包含两个整数n, m,分别表示路口的数量和道路的数量。路口由1至n编号,小明需要开车从1号路口到n号路口。 输出格式 输出一个整数,表示最优路线下小明的疲劳度。 样例输入 6 7 样例输出 76 样例说明 从1走小道到2,再走小道到3,疲劳度为52=25;然后从3走大道经过4到达5,疲劳度为20+30=50;最后从5走小道到6,疲劳度为1。总共为76。 数据规模和约定 对于30%的评测用例,1 ≤ n ≤ 8,1 ≤ m ≤ 10; |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
typedef long long int LL;
const LL MAXSIZE = 502;
const LL INF = 0x3f3f3f3f;
LL s_road[MAXSIZE][MAXSIZE];
LL b_road[MAXSIZE][MAXSIZE];
LL s_dis[MAXSIZE];
LL b_dis[MAXSIZE];
int n, m;
void dealwith_sroad() {
// 用弗洛伊德算法算出小路的最小值
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (s_road[i][j] > s_road[i][k] + s_road[k][j])
s_road[i][j] = s_road[i][k] + s_road[k][j];
}
}
}
//变为原来的平方
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
s_road[i][j] = s_road[i][j] * s_road[i][j];
}
}
}
struct Node {
bool big;
int u;
} beg, in, out;
LL Dijkstra() {
queue<Node> Q;
beg.big = 1;
beg.u = 1;
for (int i = 1; i <= n; i++)
s_dis[i] = b_dis[i] = (i == 1 ? 0 : INF);
Q.push(beg);
while (!Q.empty()) {
out = Q.front();
Q.pop();
int u = out.u;
for (int i = 1; i <= n; i++) {
if (u == i) continue;
if (out.big) {
in.big = 0;
in.u = i;
if (s_dis[i]>b_dis[u]+s_road[u][i]){
s_dis[i] = b_dis[u]+s_road[u][i];
Q.push(in);
}
in.big = 1;
//走大路
if (b_dis[i]>b_dis[u]+b_road[u][i]){
b_dis[i] = b_dis[u]+b_road[u][i];
Q.push(in);
}
} else{
//只能走大路
in.big = 1;
in.u = i;
if (b_dis[i]>s_dis[u]+b_road[u][i]){
b_dis[i] = s_dis[u]+b_road[u][i];
Q.push(in);
}
}
}
}
}
int main() {
// freopen("../in.txt", "r", stdin);
cin >> n >> m;
memset(s_road, INF, sizeof(s_road));
memset(b_road, INF, sizeof(b_road));
int t, a, b, c;
for (int i = 0; i < m; ++i) {
cin >> t >> a >> b >> c;
if (t == 1)
s_road[a][b] = s_road[b][a] = min(LL(c), s_road[a][b]);
else
b_road[a][b] = b_road[b][a] = min(LL(c), b_road[a][b]);
}
dealwith_sroad();
Dijkstra();
LL res = min(s_dis[n], b_dis[n]);
cout << res << endl;
}