HDU1385-Minimum Transport Cost(Dijkstra算法+Floyd算法)
2016-09-11 13:14
260 查看
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768K (Java/Others)
Total Submission(s): 10099 Accepted Submission(s): 2757
Problem Description
These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts:
The cost of the transportation on the path between these cities, and
a certain tax which will be charged whenever any cargo passing through one city, except for the source and the destination cities.
You must write a program to find the route which has the minimum cost.
Input
First is N, number of cities. N = 0 indicates the end of input.
The data of path cost, city tax, source and destination cities are given in the input, which is of the form:
a11 a12 ... a1N
a21 a22 ... a2N
...............
aN1 aN2 ... aNN
b1 b2 ... bN
c d
e f
...
g h
where aij is the transport cost from city i to city j, aij = -1 indicates there is no direct path between city i and city j. bi represents the tax of passing through city i. And the cargo is to be delivered from city c to city d, city e to city f, ..., and
g = h = -1. You must output the sequence of cities passed by and the total cost which is of the form:
Output
From c to d :
Path: c-->c1-->......-->ck-->d
Total cost : ......
......
From e to f :
Path: e-->e1-->..........-->ek-->f
Total cost : ......
Note: if there are more minimal paths, output the lexically smallest one. Print a blank line after each test case.
Sample Input
5
0 3 22 -1 4
3 0 5 -1 -1
22 5 0 9 20
-1 -1 9 0 4
4 -1 20 4 0
5 17 8 3 1
1 3
3 5
2 4
-1 -1
0
Sample Output
From 1 to 3 :
Path: 1-->5-->4-->3
Total cost : 21
From 3 to 5 :
Path: 3-->4-->5
Total cost : 16
From 2 to 4 :
Path: 2-->1-->5-->4
Total cost : 17
Source
Asia 1996, Shanghai (Mainland China)
Dijkstra算法:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
const int INF=0x3f3f3f3f;
int path[1005],n;
int visit[1005];
int map[1005][1005];
int x[1005];
int dis[1005];
int p,s,e,flag;
struct node
{
int id;
int val;
friend bool operator <(node a,node b)
{
return a.val>b.val;
}
} pre,nt;
void dfs(int a,int k)
{
if(a==e)
{
p=k-1;
flag=1;
return ;
}
for(int i=1; i<=n; i++)
{
if(dis[a]+map[a][i]==dis[i]&&a!=i)
{
path[k]=i;
dfs(i,k+1);
if(flag) return;
}
}
return ;
}
void dijkstra()
{
memset(visit,0,sizeof visit);
memset(dis,INF,sizeof dis);
dis[s]=0;
priority_queue<node>q;
pre.id=s;
pre.val=0;
q.push(pre);
while(!q.empty())
{
pre=q.top();
q.pop();
int id=pre.id,val=pre.val;
visit[id]=1;
for(int i=1; i<=n; i++)
{
if(!visit[i]&&dis[i]>map[id][i]+val)
{
dis[i]=map[id][i]+val;
nt.id=i;
nt.val=val+map[id][i];
q.push(nt);
}
}
}
flag=0;
dfs(s,1);
printf("From %d to %d :\n",s,e);
printf("Path: %d",s);
for(int i=1; i<=p; i++)
printf("-->%d",path[i]);
printf("\n");
printf("Total cost : %d\n",dis[e]-x[e]);
}
int main()
{
while(~scanf("%d",&n)&&n)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
scanf("%d",&map[i][j]);
if(map[i][j]==-1) map[i][j]=INF;
}
}
for(int i=1; i<=n; i++)
scanf("%d",&x[i]);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(map[i][j]!=0&&map[i][j]!=INF) map[i][j]+=x[j];
}
}
while(~scanf("%d %d",&s,&e)&&s!=-1&&e!=-1)
{
if(s==e)
{
printf("From %d to %d :\n",s,e);
printf("Path: %d\n",s);
printf("Total cost : 0\n\n");
continue;
}
dijkstra();
printf("\n");
}
}
return 0;
}
Floyd算法:
#include <iostream> #include <queue> #include <stdio.h> #include <string.h> using namespace std; int path[1005],map[1005][1005]; int s,e,a[1005][1005]; const int INF=0x3f3f3f3f; int x[1005]; int q,flag,n; void dfs(int p,int k) { if(p==e) { q=k-1;flag=1; return ; } for(int i=1; i<=n; i++) { if(map[s][p]+a[p][i]==map[s][i]&&p!=i) { path[k]=i; dfs(i,k+1); if(flag) return; } } return ; } void solve() { flag=0; dfs(s,1); printf("From %d to %d :\n",s,e); printf("Path: %d",s); for(int i=1; i<=q; i++) printf("-->%d",path[i]); printf("\n"); printf("Total cost : %d\n",map[s][e]-x[e]); } int main() { while(~scanf("%d",&n)&&n) { for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { scanf("%d",&map[i][j]); if(map[i][j]==-1) map[i][j]=INF; a[i][j]=map[i][j]; } } for(int i=1; i<=n; i++) scanf("%d",&x[i]); for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { if(map[i][j]!=0&&map[i][j]!=INF) map[i][j]+=x[j],a[i][j]+=x[j]; } } for(int k=1; k<=n; k++) { for(int i=1; i<=n; i++) { if(map[i][k]==INF) continue; for(int j=1; j<=n; j++) { if(i==j) continue; if(map[i][k]+map[k][j]<map[i][j]) map[i][j]=map[i][k]+map[k][j]; } } } while(~scanf("%d %d",&s,&e)&&s!=-1&&e!=-1) { if(s==e) { printf("From %d to %d :\n",s,e); printf("Path: %d\n",s); printf("Total cost : 0\n\n"); continue; } solve(); printf("\n"); } } return 0; }
相关文章推荐
- HDU-1385-Minimum Transport Cost
- HDU 1385 Minimum Transport Cost (Floyd算法 + 路径输出)
- hdu 1385 最短路+字典序比较 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost(Floyd打印路径)
- HDU1385 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost (最小字典序最短路径)
- HDU 1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost(Floyd + 打印路径)
- HDU 1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost(Floyd+打印字典序最小路径)
- hdu 1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost (Dijstra 最短路)
- HDU 1385 Minimum Transport Cost 最短路径题解
- HDU 1385(Minimum Transport Cost)floyd+正向返回路径
- hdu 1385 Minimum Transport Cost(最短路+输出路径)
- HDU 1385:Minimum Transport Cost【Floyd】
- 最短路 + 记录路径 之 zoj 1456 Minimum Transport Cost (hdu 1385)
- HDU 1385 Minimum Transport Cost(Floyd)
- hdu Minimum Transport Cost(1385)