CF#368 B. Bakery (暴力枚举)
来源:互联网 发布:阿里推荐算法 编辑:程序博客网 时间:2024/05/14 03:08
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
Image illustrates the first sample case. Cities with storage located in and the road representing the answer are darkened.
题目大意:1-N的城市,m条双向边,有k个仓库,分别在a1,a2……ak号城市,现在要找一个没有仓库的城市使得到任意有仓库的城市距离最短,输出距离。输出-1的情况:没有仓库or全是仓库。
解题思路:从有仓库的城市开始暴力枚举,找到没有仓库的城市,min一下距离即可。
/* ***********************************************┆ ┏┓ ┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃ ┃ ┆┆┃ ━ ┃ ┆┆┃ ┳┛ ┗┳ ┃ ┆┆┃ ┃ ┆┆┃ ┻ ┃ ┆┆┗━┓ 马 ┏━┛ ┆┆ ┃ 勒 ┃ ┆ ┆ ┃ 戈 ┗━━━┓ ┆┆ ┃ 壁 ┣┓┆┆ ┃ 的草泥马 ┏┛┆┆ ┗┓┓┏━┳┓┏┛ ┆┆ ┃┫┫ ┃┫┫ ┆┆ ┗┻┛ ┗┻┛ ┆************************************************ */#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>using namespace std;#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)#define pb push_back#define mp make_pairconst int inf_int = 2e9;const long long inf_ll = 2e18;#define inf_add 0x3f3f3f3f#define mod 1000000007#define LL long long#define ULL unsigned long long#define MS0(X) memset((X), 0, sizeof((X)))#define SelfType intSelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}#define Sd(X) int (X); scanf("%d", &X)#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())#define all(a) a.begin(), a.end()typedef pair<int, int> pii;typedef pair<long long, long long> pll;typedef vector<int> vi;typedef vector<long long> vll;inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}//#pragma comment(linker, "/STACK:102400000,102400000")int cnt,head[100005];struct Edge{ int to,nx,w;}edge[100005*2];void addedge(int u,int v,int w){ edge[cnt] = Edge{v,head[u],w}; head[u] = cnt++; edge[cnt] = Edge{u,head[v],w}; head[v] = cnt++;}int vis[100005],a[100005];int main(){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);ios::sync_with_stdio(0);cin.tie(0);int n,m,k;int u,v,w;cnt = 1;n = read(),m = read(),k = read();rep(i,1,m){ u = read(),v = read(),w = read(); addedge(u,v,w);}rep(i,0,k-1){ a[i] = read(); vis[a[i]] = 1;}int res = inf_int;rep(j,0,k-1){ u = a[j]; for(int i=head[u];i;i=edge[i].nx) { v = edge[i].to; if(!vis[v]) res = min(res,edge[i].w); }}if(res==inf_int)printf("-1");else printf("%d\n",res);return 0;}
- CF#368 B. Bakery (暴力枚举)
- cf 551B 暴力枚举
- cf 707B Bakery
- 【CodeForces 707B】Bakery(暴力)
- CodeForces 707B Bakery(建图 + 枚举)
- (CF)B. Restore Cube (暴力枚举判断)
- 枚举暴力 cf B. Preparing Olympiad
- CF #278 (Div. 2) B.(暴力枚举+推导公式+数学构造)
- codeforces-368 B. Bakery
- CF #633A(暴力枚举)
- CF#284 (Div. 2) B.(暴力)
- cf 488 B(暴力)
- #368 (Div. 2) B. Bakery
- CF 833B The Bakery(dp+线段树)
- Codeforces Round #368 (Div. 2)(B. Bakery 贪心)
- Codeforces #368(Div.2)B.Bakery【贪心】
- Codeforces Round #368 (Div. 2) B. Bakery (水题)
- Codeforces Round #368 (Div. 2) B Bakery(水)
- centos 7 安装音频视频解码器
- Java变量类型
- hdu5863 cjj's string game
- 【C++】模拟实现string类(版本二:用写时拷贝来实现)
- Java修饰符类型
- CF#368 B. Bakery (暴力枚举)
- 路灯
- web.xml加载顺序
- Codeforces Problem 707B Bakery(思维题)
- Codeforces #368(Div.2)C. Pythagorean Triples【勾股数】
- 【计算机网络-7】【第三章】介质访问控制
- jQuery生成二维码插件
- Java枚举
- linux 下使用yum的心得