1. 单源最短路径Djkstra
题目:7-9 旅游规划 (25 分)
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=510;
const int INF=1e5+10;
bool mark[maxn];
int dist[maxn];
int cos[maxn];//记录当前结点到源点的最小花费
int N,M,S,D;
int ans_dis,ans_cost;
struct Node{
int id;
int distance;
int cost;
};
vector<Node> Adj[maxn];
void Djkstra(int s,int d)
{
memset(mark,0,sizeof(mark));
fill(dist,dist+maxn,INF);
fill(cos,cos+maxn,INF);
dist[s]=0;
cos[s]=0;
for(int i=0;i<N;i++)
{
int u=-1,min=INF;
for(int j=0;j<N;j++)
{
if(!mark[j]&&dist[j]<min)
{
min=dist[j];
u=j;
}
}
if(u==-1) return;
mark[u]=true;
for(int j=0;j<Adj[u].size();j++)
{
int id=Adj[u][j].id;
if(!mark[id]&&dist[id]>dist[u]+Adj[u][j].distance)
{
dist[id]=dist[u]+Adj[u][j].distance;
cos[id]=cos[u]+Adj[u][j].cost;
}
else if(!mark[id]&&dist[id]==dist[u]+Adj[u][j].distance&&cos[id]>cos[u]+Adj[u][j].cost)
{
cos[id]=cos[u]+Adj[u][j].cost;
}
}
}
ans_dis=dist[d];
ans_cost=cos[d];
}
int main()
{
while(scanf("%d%d%d%d",&N,&M,&S,&D)!=EOF)
{
for(int i=0;i<M;i++)
{
int v,w,d,c;
scanf("%d%d%d%d",&v,&w,&d,&c);
Node tmp;
tmp.distance=d;
tmp.cost=c;
tmp.id=w;
Adj[v].push_back(tmp);
tmp.id=v;
Adj[w].push_back(tmp);
}
Djkstra(S,D);
printf("%d %d\n",ans