最短路径问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 41348 Accepted Submission(s): 11944
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)
Output
输出 一行有两个数, 最短距离及其花费。
Sample Input
3 2 1 2 5 6 2 3 4 5 1 3 0 0
Sample Output
9 11
9 11
n个点m条边,找最短路,dijkstra就行
很简单的一道题,但是题目有坑...有重边,需要判重,就酱
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define N 1005
#define INF 0x3f3f3f3f
long long c[N][N], dis[N];
int want[N];
bool vis[N];
int t, s, d;
void dijkstra(int s, int n)
{
for(int i = 0; i <= n; i++) dis[i] = INF;
memset(vis, false, sizeof(vis));
dis[s] = 0;
for(int i = 0; i <= n; i++)
{
int k = -1;
long long minn = INF;
for(int j = 0; j <= n; j++)
{
if(!vis[j] && dis[j] < minn)
{
minn = dis[j];
k = j;
}
}
if(k == -1) break;
vis[k] = true;
for(int j = 0; j <= n; j++)
{
if(!vis[j] && dis[j] > dis[k] + c[k][j])
{
dis[j] = dis[k] + c[k][j];
}
}
}
}
int main()
{
while(~scanf("%d%d%d", &t, &s, &d))
{
memset(c, INF, sizeof(c));
int maxn = 0;
for(int i = 0; i < t; i++)
{
int u, v;
long long w;
scanf("%d%d%lld", &u, &v, &w);
maxn = max(maxn, max(u, v));
if(w < c[u][v])
{
c[u][v] = c[v][u] = w;
}
}
for(int i = 0; i < s; i++)
{
int u;
scanf("%d", &u);
maxn = max(maxn, u);
c[0][u] = c[u][0] = 1;
}
for(int i = 0; i < d; i++)
{
int u;
scanf("%d", &want[i]);
maxn = max(maxn, want[i]);
}
for(int i = 0; i < d; i++)
{
c[want[i]][maxn+1] = c[maxn+1][want[i]] = 1;
}
dijkstra(0, maxn+1);
printf("%lld\n", dis[maxn+1] - 2);
}
return 0;
}