Bumped! 2017 ICPC North American Qualifier Contest （分层建图+dijstra）

题目描述

Peter returned from the recently held ACM ICPC World finals only to find that his return flight was overbooked and he was bumped from the flight! Well, at least he wasn’t beat up by the
airline and he’s received a voucher for one free flight between any two destinations he wishes.
He is already planning next year’s trip. He plans to travel by car where necessary, but he may be using his free flight ticket for one leg of the trip. He asked for your help in his planning.
He can provide you a network of cities connected by roads, the amount it costs to buy gas for traveling between pairs of cities, and a list of available flights between some of those cities. Help Peter by finding the minimum amount of money he needs to spend to get from his hometown to next year’s destination!

输入

The input consists of a single test case. The first line lists five space-separated integers n, m, f, s, and t, denoting the number of cities n (0 < n ≤ 50 000), the number of roads m (0 ≤ m ≤ 150 000), the number of flights f (0 ≤ f ≤ 1 000), the number s (0 ≤ s < n) of the city in which Peter’s trip starts, and the number t (0 ≤ t < n) of the city Peter is trying to travel to. (Cities are numbered from 0 to n − 1.)
The first line is followed by m lines, each describing one road. A road description contains three space-separated integers i, j, and c (0 ≤ i, j < n, i 6= j and 0 < c ≤ 50 000), indicating there is a road connecting cities i and j that costs c cents to travel. Roads can be used in either direction for the same cost. All road descriptions are unique.
Each of the following f lines contains a description of an available flight, which consists of two space-separated integers u and v (0 ≤ u, v < n, u 6= v) denoting that a flight from city u to city v is available (though not from v to u unless listed elsewhere). All flight descriptions are unique.

输出

Output the minimum number of cents Peter needs to spend to get from his home town to the competition,using at most one flight. You may assume that there is a route on which Peter can reach his destination.

样例输入

8 11 1 0 5
0 1 10
0 2 10
1 2 10
2 6 40
6 7 10
5 6 10
3 5 15
3 6 40
3 4 20
1 4 20
1 3 20
4 7

样例输出

45
 
题意：n个点，m条双向边，f条单向边，单向边只能用一条，且费用为0，从s到t的最短路。
思路:分层建图，两个图之间用费用为0的单向边连接，跑dijstra

 #include<bits/stdc++.h>
 using namespace std;
 
 typedef long long ll;
 const int maxn = ;
 const int ad=5e5+;
 typedef pair<ll,int>pli;
 struct Node
 {
     int y,val,next;
     Node(int y=,int val=,int next=):y(y),val(val),next(next) {}
 } node[maxn<<];
 
 int head[ad<<];
 int cnt;
 int n,m,f,s,t;
 void add1(int x,int y,int val)
 {
     node[++cnt].y=y;
     node[cnt].val=val;
     node[cnt].next=head[x];
     head[x]=cnt;
     node[++cnt].y=y+ad;
     node[cnt].val=val;
     node[cnt].next=head[x+ad];
     head[x+ad]=cnt;
 }
 
 void add2(int x,int y)
 {
     node[++cnt].y=y+ad;
     node[cnt].val=;
     node[cnt].next=head[x];
     head[x]=cnt;
 }
 priority_queue<pli,vector<pli>,greater<pli> >que;
 bool vis[ad<<];
 ll dist[ad<<];
 void dijstra()
 {
     while(!que.empty())
         que.pop();
     memset(dist,0x3f,sizeof(dist));
     memset(vis,,sizeof(vis));
     que.push(pli(,s));
     while(!que.empty())
     {
         pli tmp = que.top();
         que.pop();
         int k = tmp.second;
         ll v = tmp.first;
         if(vis[k])
             continue;
         vis[k]=;
         dist[k]=v;
         for(int i=head[k]; i; i=node[i].next)
         {
             int to=node[i].y;
             if(dist[to] > v+node[i].val)
             {
                 que.push(pli(v+node[i].val,to));
             }
         }
     }
 }
 int main()
 {
     scanf("%d%d%d%d%d",&n,&m,&f,&s,&t);
     cnt = ;
     memset(head,,sizeof(head));
     for(int i=; i<=m; i++)
     {
         int u,v,k;
         scanf("%d%d%d",&u,&v,&k);
         add1(u,v,k);
         add1(v,u,k);
     }
     for(int i=; i<=f; i++)
     {
         int u,v;
         scanf("%d%d",&u,&v);
         add2(u,v);
     }
     dijstra();
     printf("%lld\n",min(dist[t],dist[ad+t]));
 }