zoukankan      html  css  js  c++  java
  • codeforces707B: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 nm 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 uv and l (1 ≤ u, v ≤ n1 ≤ 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.

    Examples
    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
    Note

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

     

     

     

    正解:搜索

    解题报告:

      直接搜索每个仓库有没有与非仓库直接相连,若相连则更新答案。显然可行。

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cmath>
     4 #include<cstring>
     5 #include<cstdlib>
     6 #include<algorithm>
     7 using namespace std;
     8 const int MAXN = 100011;
     9 const int MAXM = 200011;
    10 const int inf = (1<<30);
    11 int n,m,k,ecnt,ans;
    12 int first[MAXN],next[MAXM],to[MAXM],w[MAXM];
    13 bool in[MAXN];
    14 
    15 inline int getint(){
    16     int w=0,q=1;char c=getchar();
    17     while(c!='-' && (c<'0' || c>'9')) c=getchar();
    18     if(c=='-') q=-1,c=getchar();
    19     while(c>='0' && c<='9') w=w*10+c-'0',c=getchar();
    20     return w*q;
    21 }
    22 
    23 int main()
    24 {
    25     n=getint(); m=getint(); k=getint();
    26     int x,y,z;
    27     for(int i=1;i<=m;i++){
    28     x=getint(); y=getint(); z=getint();
    29     next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=y; w[ecnt]=z;
    30     next[++ecnt]=first[y]; first[y]=ecnt; to[ecnt]=x; w[ecnt]=z;
    31     }
    32     for(int o=1;o<=k;o++){
    33     x=getint(); in[x]=1;
    34     } 
    35     ans=inf;
    36     for(int i=1;i<=n;i++) {
    37     if(in[i]) for(int j=first[i];j;j=next[j]) if(!in[to[j]]) ans=min(ans,w[j]);
    38     }
    39     if(ans==inf) printf("-1"); else printf("%d",ans);
    40     return 0;
    41 }
  • 相关阅读:
    产品交付物
    Java对redis的基本操作
    SourceTree使用方法
    分享几套bootstrap后台模板【TP5版】
    ThinkPHP5在PHP7以上使用QueryList4, ThinkCMF在PHP5中使用QueryList3教程
    delphi 控件背景透明代码
    delphi 程序嵌入桌面效果的实现
    delphi 半透明窗体类
    delphi 一个关于xml文件导入数据库的问题
    Delphi 自带了 Base64 编解码的单元
  • 原文地址:https://www.cnblogs.com/ljh2000-jump/p/5793863.html
Copyright © 2011-2022 走看看