题意:有两种不同的路,第一种是普通的线路,第二种是块线,你只有一张快线票,求S,到E的最短路。所以路线都是双向的,有可能必须使用快线票才能到达机场,保证最优解唯一。
思路:首先预处理两个最短路,以S为源点的最短路,以E为源点的最短路,然后枚举快线,那么答案就是min(s[u] + e[v]+dist[u][v] , s[v]+e[u]+dist[v][u])的最小值,(u,v)为快线连接的两个端点。
tip:两个2e9相加会爆int,所以在设置初始化值时,应根据情况设置inf的值。
#include <bits/stdc++.h>
#define pi pair<int,int>
#define mk make_pair
using namespace std;
const int maxn = 505,inf = 1e9;
struct node {
int u,v,dist;
bool operator < (const node & t)const {
return dist > t.dist;
}
}a[maxn * 2];
vector<pi>G[maxn];
int pre0[maxn],pre[maxn],pre1[maxn],d[maxn],s[maxn],e[maxn],vis[maxn];
void print1(int now,int end)
{
if(now != end)
{
print1(pre[now],end);
printf(" %d",now);
}
else printf("%d",now);
}
void print2(int now,int end)
{
if(now != end)
{
printf("%d ",now);
print2(pre1[now],end);
}
else printf("%d",now);
}
void solve(int n,int S,int E)
{
int ans = s[E];
int now,end;
now = end = 0;
for(int i=1;i<=n;i++)
{
int u = a[i].u;
int v = a[i].v;
int w = a[i].dist;
if(s[u] + e[v] + w < ans)
{
ans = s[u] + e[v] + w;
now = u;
end = v;
}
if(s[v] + e[u] + w < ans)
{
ans = s[v] + e[u] + w;
now = v;
end = u;
}
}
if(!now)
{
print1(E,S);
printf("\n");
puts("Ticket Not Used");
}
else
{
print1(now,S);
printf(" ");
print2(end,E);
printf("\n");
printf("%d\n",now);
}
printf("%d\n",ans);
}
void dij(int start,int n,int flag)
{
for(int i=1;i<=n;i++)vis[i]=0,d[i]=inf,pre0[i]=0;
priority_queue<node>q;
node tmp;
tmp.dist = 0,tmp.u = start;
d[start] = pre0[start] = 0;
q.push(tmp);
while(!q.empty())
{
tmp = q.top();
q.pop();
int u =tmp.u;
if(vis[u])continue;
vis[u] = 1;
for(int i=0;i<G[u].size();i++)
{
pi xbb = G[u][i];
int v = xbb.first;
int w = xbb.second;
if(d[v] > d[u] + w)
{
d[v] = d[u] + w;
pre0[v] = u;
tmp.dist = d[v];
tmp.u = v;
q.push(tmp);
}
}
}
if(flag == 1)
{
for(int i=1;i<=n;i++)
{
pre[i] = pre0[i];
s[i] = d[i];
}
return ;
}
for(int i=1;i<=n;i++)
{
pre1[i] = pre0[i];
e[i] = d[i];
}
}
int main()
{
int n,S,E,kase = 0;
while(~scanf("%d%d%d",&n,&S,&E))
{
int m;
scanf("%d",&m);
for(int i=1;i<=n;i++)G[i].clear();
for(int i=1;i<=m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
G[u].push_back(mk(v,w));
G[v].push_back(mk(u,w));
}
int q;
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
scanf("%d%d%d",&a[i].u,&a[i].v,&a[i].dist);
}
dij(S,n,1);
dij(E,n,2);
if(kase++)puts("");
solve(q,S,E);
}
}