codeforces--707B. Bakery

cf 707B

题解

n个顶点的图，在 k 个顶点和另外 n - k 个顶点中寻一条最短的边。

#include <bits/stdc++.h>
using namespace std;

const double eps = 1E-8;
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
const int inf = 0x3f3f3f3f;
const int N = 1E5 + 7;

#define MS(a, x) memset(a, x, sizeof(a))
#define MP make_pair
#define fst first
#define sec second
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

typedef long long LL;
bool vis[N];
int  store[N];
vector< pair<int, LL> > edges[N];
int n, m, k;


void solve(){
    if(k == 0){
        cout << -1 << endl;
        return;
    }

    for(int i = 0; i < k; ++i){
        cin >> store[i];
        vis[store[i]] = true;
    }
    if(k == n){
        cout << -1 << endl;
        return;
    }

    LL ans = inf;
    for(int i = 0; i < k; ++i){
        int u = store[i];
        for(int j = 0; j < edges[u].size(); ++j){
            int v = edges[u][j].fst;
            if(vis[v]) continue;
            LL w = edges[u][j].sec;
            ans = min(ans, w);
        }
    }

    if(ans == inf) ans = -1;
    cout << ans << endl;
}

int main(){
#ifdef LOCAL
freopen("data.in", "r", stdin);
#endif // LOCAL

    ios::sync_with_stdio(false);
    cin >> n >> m >> k;
    for(int i = 0; i < m; ++i){
        int u, v;
        LL w;
        cin >> u >> v >> w;
        edges[u].push_back(MP(v, w));
        edges[v].push_back(MP(u, w));
    }

    solve();

    return 0;
}