zoukankan      html  css  js  c++  java
  • cf368 Bakery

    B. Bakery
    time limit per test2 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    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.

    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.
    题意:给出你n,m,k;
    n代表n个城市,m代表m条路,k是给出k个城市
    从这k个城市中选出1个来开面包店,其他的则不能再用。

    #include<stdio.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    #include<map>
    map<int,int>m;
    const int maxn=100005;
    struct node
    {
        int x,y,d;
    } num[maxn];
    int cmp(node a,node b)
    {
        return a.d<b.d;
    }
    int main()
    {
        int n,M,k;
        while(~scanf("%d%d%d",&n,&M,&k))
        {
            m.clear();
            for(int i=0; i<M; i++)
            {
                scanf("%d%d%d",&num[i].x,&num[i].y,&num[i].d);
            }
            sort(num,num+M,cmp);//按路(小<大)排序
            for(int i=0; i<k; i++)
            {
                int p;
                scanf("%d",&p);
                m[p]=1;//用到的点进行标记
            }
            int flag=0;
            for(int i=0; i<M; i++)
            {
                if(m[num[i].x]==1&&m[num[i].y]==1)//两个不能都用上
                    continue;
                else if(m[num[i].x]==1||m[num[i].y]==1)
                {
                    flag=1;
                    printf("%d
    ",num[i].d);
                    break;
                }
            }
            if(flag==0)
            {
                printf("-1
    ");
            }
        }
        return 0;
    }
    
    "No regrets."
  • 相关阅读:
    洛谷 P1032 子串变换
    RCTF 2017 easyre153
    SUCTF 2016 : dMd
    南邮 base64全家桶
    洛谷 P1908 逆序对
    2019中山大学程序设计竞赛 Triangle
    WhiteHat Contest 11 : re1100
    P1010 幂次方
    洛谷 P1088 火星人
    南邮 骚年来一发吗
  • 原文地址:https://www.cnblogs.com/zxy160/p/7215149.html
Copyright © 2011-2022 走看看