Codeforces - 707B Bakery

M - Bakery

Description

Masha wants to open her own bakery and bake muffins in one of the n cities numbered from 1 to n. There are m bidirectional roads, each of whose connects some pair of cities.

To bake muffins in her bakery, Masha needs to establish flour supply from some storage. There are only k storages, located in different cities numbered a1, a2, ..., ak.

Unforunately the law of the country Masha lives in prohibits opening bakery in any of the cities which has storage located in it. She can open it only in one of another n - k cities, and, of course, flour delivery should be paid — for every kilometer of path between storage and bakery Masha should pay 1 ruble.

Formally, Masha will pay x roubles, if she will open the bakery in some city b (ai ≠ b for every 1 ≤ i ≤ k) and choose a storage in some city s (s = aj for some 1 ≤ j ≤ k) and b and s are connected by some path of roads of summary length x (if there are more than one path, Masha is able to choose which of them should be used).

Masha is very thrifty and rational. She is interested in a city, where she can open her bakery (and choose one of k storages and one of the paths between city with bakery and city with storage) and pay minimum possible amount of rubles for flour delivery. Please help Masha find this amount.

Input

The first line of the input contains three integers n, m and k (1 ≤ n, m ≤ 105, 0 ≤ k ≤ n) — the number of cities in country Masha lives in, the number of roads between them and the number of flour storages respectively.

Then m lines follow. Each of them contains three integers u, v and l (1 ≤ u, v ≤ n, 1 ≤ l ≤ 109, u ≠ v) meaning that there is a road between cities u and v of length of l kilometers .

If k > 0, then the last line of the input contains k distinct integers a1, a2, ..., ak (1 ≤ ai ≤ n) — the number of cities having flour storage located in. If k = 0 then this line is not presented in the input.

Output

Print the minimum possible amount of rubles Masha should pay for flour delivery in the only line.

If the bakery can not be opened (while satisfying conditions) in any of the n cities, print  - 1 in the only line.

Sample Input

Input

5 4 2
1 2 5
1 2 3
2 3 4
1 4 10
1 5

Output

3

Input

3 1 1
1 2 3
3

Output

-1

Hint

Image illustrates the first sample case. Cities with storage located in and the road representing the answer are darkened.

 

题意:

有n个城市，从1-n标号，在这些n个城市中有 m 条道路，每经过一条道路，会花费一卢布

在这 n个城市中有 k 个城市是仓库

Masha 想在这些城市中开一间面包店，但是由于规定，面包店不能建在仓库里，由于面包原料由仓库供应，所以面包店与仓库之间必须具有可达的线路，求最少的花费

思路：

根据仓库号，寻找与其他城市之间的最短路程

注意：

如果用一个二维数组 （或者一个map ）来表示两点间的路程，那么在遍历的时候会用 1e5 × 1e5 的循环，会 T

// 错误代码
for(int i=1; i<=n; i++){
      if(vis1[i] == 1){
          for(int j=1; j<=n; j++){
              if(i!=j && vis1[j] == 0 && mapp[i][j] != 0){
                    if(mapp[i][j] < minn)
                        minn = mapp[i][j];
              }
          }
      }
 }

正确方法是：

利用 二维 vector  与 二维 map 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#define memset(a,n) memset(a,n,sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXX = 1e5+10;
int vis[MAXX];    // 标记访问 仓库
map<int,map<int,int> >mapp;     // 记录两点间距离

vector<vector<int> > vect(MAXX);  
// vect 中存的是顶点，例如 vect[1] 中有 2 3 ，代表 1 与 2 相连，1 与 3 相连

int main()
{
    int n,m,k,x,be,en,v;
    cin >> n >> m >> k;
    memset(vis,0);

    for(int i=0; i<m; i++){
        cin >> be >> en >> v;
        if(mapp[be][en] == 0 || mapp[en][be] == 0){ // 如果两点间还没有记录过距离，初始化距离
            mapp[be][en] = v;
            mapp[en][be] = v;
            vect[be].push_back(en);
            vect[en].push_back(be);
        } else if(v < mapp[be][en] || v < mapp[en][be]){ // 如果两点间存在多条道路，存最短距离
            mapp[be][en] = v;
            mapp[en][be] = v;
            vect[be].push_back(en);
            vect[en].push_back(be);
        }
    }

    for(int i=0; i<k; i++){
        cin >> x;
        vis[x] = 1;
    }

    int minn = INF;
    for(int i=1; i<=n; i++){
        if(vis[i] == 1){ // 第 i 个城市是仓库
           
             // 这里需要注意一下,j代表的是下标,应该用 vect[i][j] 代表与i相连的第j个顶点
            for(int j=0; j<vect[i].size(); j++){
                if(i!=vect[i][j] && vis[vect[i][j]] == 0 && mapp[i][vect[i][j]] != 0 && mapp[i][vect[i][j]] < minn){
                    minn = mapp[i][vect[i][j]];
                }
            }
        }
    }

    if(minn == INF)
        cout << "-1" << endl;
    else
        cout << minn << endl;
}