【Codeforces Round #368 (Div. 2)】Codeforces 707B Bakery

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.

模拟。

#include<cstdio>
#include<cstring>
int fir[100010],ne[200010],to[200010],len[200010];
bool is[100010];
void add(int num,int f,int t,int l)
{
	ne[num]=fir[f];
	fir[f]=num;
	to[num]=t;
	len[num]=l;
}
int main()
{
	int i,j,k,m,n,p,q,x,y,z,ans=-1;
	scanf("%d%d%d",&n,&m,&k);
	for (i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		add(i*2,x,y,z);
		add(i*2+1,y,x,z);
	}
	for (i=1;i<=k;i++)
	{
		scanf("%d",&x);
		is[x]=1;
	}
	for (i=1;i<=n;i++)
	  if (!is[i])
	    for (j=fir[i];j;j=ne[j])
	      if (is[to[j]])
	        if (len[j]<ans||ans==-1)
	          ans=len[j];
	printf("%d\n",ans);
}