PAT 旅游规划

 1 #include <stdio.h>
 2 #define MAX 100000
 3 typedef struct
 4 {
 5     int weight;
 6     int cost;
 7 }graph;
 8 int N,M,S,D;
 9 graph g[500][500];
10 int dis[500];
11 int cost[500];
12 int flag[500];
13 void Dijkstra(int v)
14 {
15     int min,i,j,pos;
16     
17     for(i=0;i<N;i++)
18     {
19         if(g[v][i].weight>0 )
20         {
21             dis[i]=g[v][i].weight;    
22             cost[i]=g[v][i].cost;
23         }        
24     }
25     flag[v]=1;
26     for(i=0;i<N;i++)
27     {
28         min=MAX;
29         pos=v;
30         for(j=i;j<N;j++)
31         {
32             if(flag[j]!=1 &&dis[j]<min &&dis[j]>0)
33             {
34                 min=dis[j];
35                 pos=j;
36             }
37         }
38         flag[pos]=1;
39     
40         for(j=0;j<N;j++)
41         {
42             if(flag[j]!=1&&dis[pos]+g[pos][j].weight<dis[j] &&g[pos][j].weight>0&&dis[j]>0)
43             {
44                 dis[j]=dis[pos]+g[pos][j].weight;
45                 cost[j]=cost[pos]+g[pos][j].cost;
46             }
47             else if(dis[pos]+g[pos][j].weight==dis[j] &&cost[j]>cost[pos]+g[pos][j].cost)
48             {
49                 cost[j]=cost[pos]+g[pos][j].cost;
50             }
51         }
52     }
53     printf("%d %d\n",dis[D],cost[D]);    
54 }
55 main()
56 {
57     int a,b,l,c;
58     int i,j;
59     scanf("%d%d%d%d",&N,&M,&S,&D);
60     for(i=0;i<M;i++)
61     {
62         scanf("%d%d%d%d",&a,&b,&l,&c);
63         g[a][b].weight=g[b][a].weight=l;
64         g[a][b].cost=g[b][a].cost=c;
65     }
66     Dijkstra(S);
67 }