最短路径问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21077 Accepted Submission(s): 6285
Problem Description
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。
Input
输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。
(1<n<=1000, 0<m<100000, s != t)
(1<n<=1000, 0<m<100000, s != t)
Output
输出 一行有两个数, 最短距离及其花费。
Sample Input
3 2 1 2 5 6 2 3 4 5 1 3 0 0
Sample Output
9 11
最短路模版,用scanf不然会超时
Source
#include <iostream>
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=1100;
int s[N][N], p[N][N] ,book[N], dis[N], pis[N];
const int inf=9999999;
int main()
{
int m, n;
while(scanf("%d %d",&n, &m),n!=0&&m!=0)
{
int a, b, d, q;
memset(s,0,sizeof(s));
memset(p,0,sizeof(p));
memset(book,0,sizeof(book));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i!=j)
{
s[i][j]=s[j][i]=inf;
p[i][j]=p[j][i]=inf;
}
}
}
for(int i=0;i<m;i++)
{
scanf("%d %d %d %d", &a, &b, &d, &q);
if(d<s[a][b])
{
s[a][b]=s[b][a]=d;
p[a][b]=p[b][a]=q;
}
else if(d==s[a][b]&&q<p[a][b])
{
p[a][b]=p[b][a]=q;
}
}
int si, ti;
scanf("%d %d", &si, &ti);
for(int i=1;i<=n;i++)
{
dis[i]=s[si][i];
pis[i]=p[si][i];
}
book[si]=1;
for(int i=1;i<n;i++)
{
int mint=inf;
int u=-1;
for(int j=1;j<=n;j++)
{
if(!book[j]&&dis[j]<mint)
{
u=j;
mint=dis[u];
}
}
if(u==-1)
{
break;
}
book[u]=1;
for(int j=1;j<=n;j++)
{
if(!book[j]&&dis[j]>dis[u]+s[u][j]&&s[u][j]!=inf)
{
dis[j]=dis[u]+s[u][j];
pis[j]=pis[u]+p[u][j];
}
else if(!book[j]&&dis[j]==dis[u]+s[u][j]&&s[u][j]!=inf&&pis[j]>pis[u]+p[u][j]&&p[u][j]!=inf)
{
pis[j]=pis[u]+p[u][j];
}
}
}
cout<<dis[ti]<<' '<<pis[ti]<<endl;
}
return 0;
}
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=1100;
int s[N][N], p[N][N] ,book[N], dis[N], pis[N];
const int inf=9999999;
int main()
{
int m, n;
while(scanf("%d %d",&n, &m),n!=0&&m!=0)
{
int a, b, d, q;
memset(s,0,sizeof(s));
memset(p,0,sizeof(p));
memset(book,0,sizeof(book));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i!=j)
{
s[i][j]=s[j][i]=inf;
p[i][j]=p[j][i]=inf;
}
}
}
for(int i=0;i<m;i++)
{
scanf("%d %d %d %d", &a, &b, &d, &q);
if(d<s[a][b])
{
s[a][b]=s[b][a]=d;
p[a][b]=p[b][a]=q;
}
else if(d==s[a][b]&&q<p[a][b])
{
p[a][b]=p[b][a]=q;
}
}
int si, ti;
scanf("%d %d", &si, &ti);
for(int i=1;i<=n;i++)
{
dis[i]=s[si][i];
pis[i]=p[si][i];
}
book[si]=1;
for(int i=1;i<n;i++)
{
int mint=inf;
int u=-1;
for(int j=1;j<=n;j++)
{
if(!book[j]&&dis[j]<mint)
{
u=j;
mint=dis[u];
}
}
if(u==-1)
{
break;
}
book[u]=1;
for(int j=1;j<=n;j++)
{
if(!book[j]&&dis[j]>dis[u]+s[u][j]&&s[u][j]!=inf)
{
dis[j]=dis[u]+s[u][j];
pis[j]=pis[u]+p[u][j];
}
else if(!book[j]&&dis[j]==dis[u]+s[u][j]&&s[u][j]!=inf&&pis[j]>pis[u]+p[u][j]&&p[u][j]!=inf)
{
pis[j]=pis[u]+p[u][j];
}
}
}
cout<<dis[ti]<<' '<<pis[ti]<<endl;
}
return 0;
}