codeforces 707BBakery(最小生成树)
来源:互联网 发布:python中统计字符串 编辑:程序博客网 时间:2024/05/29 12:21
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.
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.
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.
5 4 21 2 51 2 32 3 41 4 101 5
3
3 1 11 2 33
-1
题意:给你N个点M条无向边,其中有K个面粉站,现在一个人要在不是面粉站的点上开店,问到面粉站的最短距离是多少。无法开店输出-1.
思路:把边长按距离从小到大排序,出现的第一个只含一个面粉店的边为所求。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1e5 + 10;struct Node{ int x,y,val;}node[maxn];bool cmp(Node a,Node b){ return a.val < b.val;}int main(){ bool vis[maxn]; int n,m,k; memset(vis,false,sizeof(vis)); scanf("%d%d%d",&n,&m,&k); for(int i = 0 ; i < m ; i++) scanf("%d%d%d",&node[i].x,&node[i].y,&node[i].val); sort(node,node+m,cmp); for(int i = 0 ; i < k ; i++) { int d; scanf("%d",&d); vis[d] = true; } int ans = -1; for(int i = 0 ; i < m ; i++) { if((vis[node[i].x] && !vis[node[i].y]) || (!vis[node[i].x] && vis[node[i].y])){ ans = node[i].val; break; } } printf("%d\n",ans); return 0;}
- codeforces 707BBakery(最小生成树)
- 【最小生成树】Codeforces 707B Bakery
- 最小生成树(kruskal)Codeforces 472D
- CodeForces 125EMST Company(最小度限制生成树)
- codeforces 76A Gift 最小生成树
- 【Codeforces 609E】【Stree】【最小生成树】
- codeForces 472D 最小生成树
- codeforces 888G.Xor-MST(01字典树+贪心+最小异或生成树)
- (Educational Codeforces Round 9)Magic Matrix(最小生成树)
- (Educational Codeforces Round 9)Magic Matrix(最小生成树)★
- Codeforces Round #446 (Div. 2) E. Envy 最小生成树(kruscal原理)(离线查询)
- [Codeforces 125E] MST Company (单度限制最小生成树)
- codeforces 606D. Lazy Student(#335 逆最小生成树)
- CodeForces 733 F.Drivers Dissatisfaction(最小生成树-Kruskal+在线倍增法)
- CodeForces 827D Round #423 Div2F&Div1D:LCA+路径压缩+MST(最小生成树)
- Codeforces 827D Best Edge Weight (最小生成树 + 树链剖分/倍增/并查集)
- codeforces 632F. Magic Matrix (最小生成树)
- Codeforces 827 D 最小生成树+倍增 解题报告
- hdu5773 2016年多校4 nlogn求LIS
- Tomcat+Cas整合SSO
- jzoj 2040. 【2016.5.21普及组模拟】博物馆
- mvc
- 电脑检查端口被占用问题及解决
- codeforces 707BBakery(最小生成树)
- 深入理解Java运行时数据区
- 作用域
- SLF4J: Class path contains multiple SLF4J bindings.问题解决方案
- c++安全的释放指针
- cocos2d-x-3.0学习笔记之如何实现地图的卷动
- 数据库操作
- 在链表上实现单词统计
- 基数求和