题目链接:点击打开链接
思路:最短路径问题,两种做法。一,利用Dijkstra算法,做适当变形,求出相应路径。二,搜索,先bfs出出发点到所有站的最短距离,再利用dfs搜索出符合要求的目标路径。
原文有句话要注意,“If the quickest path is not unique, output the one with the minimum number of transfers, which is guaranteed to be unique.”,这句话的意思是,如果两条路径均为最短路径,取经过线路最少的那个。
Dijkstra版本:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 0x3f3f3f3f
int cnt,head[10005];
int u[20005],v[20005],nex[20005],line[20005];
int dis[10005],tra[10005],pre[10005],preRoute[10005];
vector<int> v1;
struct node{
int y,dis,tra,lin;
node(int a,int b,int c,int d):y(a),dis(b),tra(c),lin(d){}
bool operator<(const node& bb)const{
if(dis != bb.dis){
return bb.dis < dis;
}
else{
return bb.tra < tra;
}
}
};
priority_queue<node> q;
void add(int x,int y,int num){
cnt++;
u[cnt] = x;
v[cnt] = y;
nex[cnt] = head[x];
head[x] = cnt;
line[cnt] = num;
}
void dijkstra(int start,int end){
v1.clear();
memset(dis,INF,sizeof(dis));
memset(pre,-1,sizeof(pre));
memset(tra,INF,sizeof(tra));
dis[end] = 0;
tra[end] = 0;
pre[end] = -1;
q.push(node(end,0,0,0));
while(!q.empty()){
node te = q.top();
q.pop();
for(int i = head[te.y];i;i = nex[i]){
if(dis[v[i]] == INF || dis[v[i]] > te.dis + 1){
dis[v[i]] = te.dis + 1;
pre[v[i]] = te.y;
tra[v[i]] = te.tra + (line[i] != te.lin);
preRoute[v[i]] = line[i];
q.push(node(v[i],dis[v[i]],tra[v[i]],line[i]));
}
else if(dis[v[i]] == te.dis + 1 && tra[v[i]] > te.tra + (line[i] != te.lin)){
pre[v[i]] = te.y;
preRoute[v[i]] = line[i];
tra[v[i]] = te.tra + (line[i] != te.lin);
q.push(node(v[i],dis[v[i]],tra[v[i]],line[i]));
}
}
}
int now = start;
while(now != -1){
v1.push_back(now);
now = pre[now];
}
printf("%d\n",dis[start]);
preRoute[end] = 0;
int p = v1[0];
for(int i = 0;i < v1.size() - 1;i++){
if(preRoute[v1[i]] != preRoute[v1[i + 1]]){
printf("Take Line#%d from %04d to %04d.\n",preRoute[v1[i]],p,v1[i + 1]);
p = v1[i + 1];
}
}
}
int main(){
int n;
scanf("%d",&n);
cnt = 0;
memset(head,0,sizeof(head));
memset(nex,0,sizeof(nex));
for(int i = 1;i <= n;i++){
int m,pre,now;
scanf("%d%d",&m,&pre);
for(int j = 1;j < m;j++){
scanf("%d",&now);
add(pre,now,i);
add(now,pre,i);
pre = now;
}
}
int q,start,end;
scanf("%d",&q);
while(q--){
scanf("%d%d",&start,&end);
dijkstra(start,end);
}
return 0;
}
搜索版本:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
//存图
int cnt;
int u[30000],v[30000],line[30000],nex[30000],head[10000];//(u,v):边;line[i]:边所在的线路;u没用到,可以去掉
int minTran,dis[10000];
vector<pair<int,int> > te(30000),re;
void bfs(int sta){//先bfs出出发点到所有站的最短距离
queue<int> q;
q.push(sta);
dis[sta] = 0;
while(!q.empty()){
int t = q.front();
q.pop();
for(int i = head[t];i;i = nex[i]){
if(dis[v[i]] == INF){
dis[v[i]] = dis[t] + 1;
q.push(v[i]);
}
}
}
return;
}
void dfs(int sta,int des,int preLine,int size,int tran){//搜索路径;sta:当前站点;des:目的地;perLine:上一段所在的线路;size:用于te大小;tran:转线路次数
if(sta == des){
if(tran < minTran){
minTran = tran;
re.clear();
for(int i = 0;i < size;i++){
re.push_back(te[i]);
}
}
}
if(dis[sta] == dis[des]) return;
for(int i = head[sta];i;i = nex[i]){
if(dis[v[i]] != dis[sta] + 1) continue;
pair<int,int> t = make_pair(v[i],line[i]);
te[size] = t;
dfs(v[i],des,line[i],size + 1,tran + (preLine != line[i]));
}
}
int main(){
int n,m,s;
int k,sta,des;
scanf("%d",&n);
cnt = 0;
for(int i = 1;i <= n;i++){
int pre;
scanf("%d%d",&m,&pre);
for(int j = 1;j < m;j++){
scanf("%d",&s);
cnt++;
u[cnt] = pre;v[cnt] = s;line[cnt] = i;nex[cnt] = head[pre];head[pre] = cnt;
cnt++;
u[cnt] = s;v[cnt] = pre;line[cnt] = i;nex[cnt] = head[s];head[s] = cnt;
pre = s;
}
}
scanf("%d",&k);
while(k--){
scanf("%d%d",&sta,&des);
memset(dis,INF,sizeof(dis));
bfs(sta);
minTran = INF;
dfs(sta,des,0,0,0);
re.push_back(make_pair(-1,0));//用于最后一段路线的输出
int now = sta;
printf("%d\n",dis[des]);
for(int i = 0;i < re.size() - 1;i++){
if(re[i].second == re[i + 1].second) continue;
printf("Take Line#%d from %04d to %04d.\n",re[i].second,now,re[i].first);
now = re[i].first;
}
}
return 0;
}