HDU 2680

Choose the best route

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12308    Accepted Submission(s): 3999

Problem Description

One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

 

Input

There are several test cases. 
Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home.
Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes .
Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations.

 

Output

The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.

 

Sample Input

  
  

   
   5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1
  
  

 

Sample Output

  
  

   
   1
-1
  
  
  
  


  
  

题目大意：

从w个点出发，到s的最短距离是什么

两个思路

①从s出发到w点

②从w个点出发到s点

//第一种
#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
         using namespace std; typedef long long ll; const int maxn = 1000 + 5; const ll inf = 1e16; struct Edge{ int from, to; ll val; Edge(int from, int to, ll val): from(from), to(to), val(val){} }; struct node{ int u; ll d; node(int u, ll d): u(u), d(d){} bool operator < (const node &a) const { return d > a.d; } }; vector 
        
          edges; vector 
         
           G[maxn]; int n, m, s; ll d[maxn]; bool vis[maxn]; void init(){ edges.erase(edges.begin(), edges.end()); for (int i = 0; i <= n; i++){ G[i].erase(G[i].begin(), G[i].end()); } for (int i = 0; i < m; i++){ int u, v; ll val; scanf("%d%d%I64d", &u, &v, &val); edges.push_back(Edge(v, u, val)); int l = edges.size(); G[v].push_back(l - 1); } } void dijkstra(){ for (int i = 1; i <= n; i++){ vis[i] = false; d[i] = inf; } priority_queue 
          
            que; d[s] = 0; que.push(node(s, d[s])); while (!que.empty()){ node x = que.top(); que.pop(); int u = x.u; if (vis[u]) continue; vis[u] = true; for (int i = 0; i < G[u].size(); i++){ Edge y = edges[G[u][i]]; if (d[y.to] > d[u] + y.val){ d[y.to] = d[u] + y.val; que.push(node(y.to, d[y.to])); } } } } int main(){ while (scanf("%d%d%d", &n, &m, &s) == 3){ init(); dijkstra(); ll res = inf; int t; scanf("%d", &t); int w; for (int i = 0; i < t; i++){ scanf("%d", &w); //printf("%d\n", w); //printf("d[w] = %I64d\n", d[w]); res = min(res, d[w]); } if (res == inf) printf("-1\n"); else printf("%I64d\n", res); } return 0; } //第二种 #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 using namespace std; typedef long long ll; const int maxn = 1000 + 5; const ll inf = 1e16; struct Edge{ int from, to; ll val; Edge(int from, int to, ll val): from(from), to(to), val(val){} }; struct node{ int u; ll d; node(int u, ll d): u(u), d(d){} bool operator < (const node &a) const { return d > a.d; } }; vector 
                
                  edges; vector 
                 
                   G[maxn]; int n, m, s; ll d[maxn]; bool vis[maxn]; void init(){ edges.erase(edges.begin(), edges.end()); for (int i = 0; i <= n; i++){ G[i].erase(G[i].begin(), G[i].end()); } for (int i = 0; i < m; i++){ int u, v; ll val; scanf("%d%d%I64d", &u, &v, &val); edges.push_back(Edge(v, u, val)); int l = edges.size(); G[v].push_back(l - 1); } } void dijkstra(){ for (int i = 1; i <= n; i++){ vis[i] = false; d[i] = inf; } priority_queue 
                  
                    que; d[s] = 0; que.push(node(s, d[s])); while (!que.empty()){ node x = que.top(); que.pop(); int u = x.u; if (vis[u]) continue; vis[u] = true; for (int i = 0; i < G[u].size(); i++){ Edge y = edges[G[u][i]]; if (d[y.to] > d[u] + y.val){ d[y.to] = d[u] + y.val; que.push(node(y.to, d[y.to])); } } } } int main(){ while (scanf("%d%d%d", &n, &m, &s) == 3){ init(); dijkstra(); ll res = inf; int t; scanf("%d", &t); int w; for (int i = 0; i < t; i++){ scanf("%d", &w); //printf("%d\n", w); //printf("d[w] = %I64d\n", d[w]); res = min(res, d[w]); } if (res == inf) printf("-1\n"); else printf("%I64d\n", res); } return 0; }