[Codeforces #368 div2 Bakery] 水题
题目链接:[Codeforces #368 div2 Bakery]
题意描述:
给定N个点M条无向带权边,(1 ≤ n, m ≤ 1e5, 0 ≤ k ≤ n),将N个点分成两个集合A, B,每个集合的元素个数分别为K, N - K。给定集合A的所有元素。 然后从集合A中找一个顶点,从集合B中找一个顶点,使得这两个顶点的距离最小。求这个最小距离。
如果两个集合不连通,输出-1。
解题思路:
直接遍历每条边,找出连接两个集合的最短边就好了。
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
#define fst first
#define snd second
//typedef __int64 LL;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
const int MAXM = 1e5 + 5;
int T, N, M, K, cas;
struct Edge {
int u, v, w;
Edge() {}
Edge (int u, int v, int w) : u (u), v (v), w (w) {}
bool operator < (const Edge& e) const {
return w < e.w;
}
} edges[MAXM];
int tot;
bool F[MAXN];
void init() {
tot = 0;
memset (F, false, sizeof (F) );
}
void add_edge (int u, int v, int w) {
edges[tot ++] = Edge (u, v, w);
}
int main() {
#ifndef ONLINE_JUDGE
FIN;
#endif // ONLINE_JUDGE
int u, v, w;
while (~scanf ("%d %d %d", &N, &M, &K) ) {
init();
for (int i = 0; i < M; i++) {
scanf ("%d %d %d", &u, &v, &w);
add_edge (u, v, w);
}
for (int i = 0; i < K; i++) {
scanf ("%d", &u);
F[u] = true;
}
int res = INF;
for (int i = 0; i < M; i ++) {
u = edges[i].u, v = edges[i].v, w = edges[i].w;
if (F[u] == F[v]) continue;
res = min (res, w);
}
if (res == INF) printf ("-1");
else printf ("%d\n", res);
}
return 0;
}