daxia兼职开uber,现在接到一个两人拼车单.已知如下信息:
地图上共有n个点,m条有向行驶通道.
daxia位于点s;
客人一位于点x1,目的地为y1;
客人二位于点x2,目的地为y2.
请帮daxia计算送完两个乘客的最短行驶路程.
Input
测试包含多组数据,每组数据第一行包含两个整数:n(1<=n<=1000),m(1<=m<=100000).
第二行包含五个整数:s,x1,y1,x2,y2(1<=s,x1,y1,x2,y2<=n).
接下来包含m行,每行三个整数:u,v,d(1<=u,v<=n,1<=d<=100).
Output
每组数据输出一行一个整数表示送完两个乘客的最短行驶路程,数据保证肯定能送到.
Sample Input
4 8
4 1 2 2 3
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3
Sample Output
11
Hint
样例接送路线:(4)->2->(1)->(2)->1->(3)
分析:共计六种情况,分开跑最短路即可!
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<vector>
#include<algorithm>
#define LL long long
using namespace std;
const LL INF = 1e10;
LL n,m,s,x1,y1,x2,y2,u,v,d;
LL mp[1010][1010],vis[1010];
LL dis[10][1010];
void dij(int x,int p){
memset(vis,0,sizeof vis);
for(int i=1;i<=n;i++){
if(!mp[x][i]){
dis[p][i] = INF;
continue;
}
dis[p][i] = mp[x][i];
}
dis[p][x] = 0;
vis[x] = 1;
while(1){
LL min = INF;
LL k = 0;
for(int i=1;i<=n;i++){
if(vis[i]||min<=dis[p][i]) continue;
min = dis[p][i];
k = i;
}
if(k==0) break;
vis[k] = 1;
for(int i=1;i<=n;i++){
if(!mp[k][i]||vis[i]||dis[p][i]<=dis[p][k]+mp[k][i]) continue;
dis[p][i] = dis[p][k] + mp[k][i];
}
}
}
int main()
{
while(scanf("%lld%lld",&n,&m)!=EOF){
memset(dis,0,sizeof dis);
memset(mp,0,sizeof mp);
scanf("%lld%lld%lld%lld%lld",&s,&x1,&y1,&x2,&y2);
for(int i=0;i<m;i++){
scanf("%lld%lld%lld",&u,&v,&d);
if(mp[u][v]!=0)
mp[u][v] = min(mp[u][v],d);
else mp[u][v] = d;
}
dij(s,1);
dij(x1,2);
dij(x2,3);
dij(y1,4);
dij(y2,5);
LL ans = dis[1][x1] + dis[2][y1] + dis[4][x2] + dis[3][y2];
ans = min(ans,dis[1][x1] + dis[2][x2] + dis[3][y1] + dis[4][y2]);
ans = min(ans,dis[1][x1] + dis[2][x2] + dis[3][y2] + dis[5][y1]);
ans = min(ans,dis[1][x2] + dis[3][y2] + dis[5][x1] + dis[2][y1]);
ans = min(ans,dis[1][x2] + dis[3][x1] + dis[2][y2] + dis[5][y1]);
ans = min(ans,dis[1][x2] + dis[3][x1] + dis[2][y1] + dis[4][y2]);
printf("%lld\n",ans);
}
return 0;
}