思路:
初始化两倍大并查集,将怨气值关系存入结构体数组中,按照怨气值大小进行排序,从高到低遍历,遇到根节点相同(在同一监狱)就找到,直接输出;否则将他们分入不同监狱(彼此的补集相连接)
#include <algorithm>
#include <cstdio>
using namespace std;
int f[40004];
struct held {
int a, b, y;
} cri[100001];
int cmp(held p, held q) {
return p.y > q.y;
}
int fa(int x) { //寻找祖先判断是否相连并沿途更新父节点,并查集基本操作
if (f[x] != x) {
f[x] = fa(f[x]);
}
return f[x];
}
int main() {
int n, m, i, g, h;
bool ff = 1;
scanf("%d%d", &n, &m); //罪犯的数量 要输入的矛盾数量
for (i = 1; i <= 2 * n; i++) //初始化
f[i] = i;
for (i = 1; i <= m; i++)
scanf("%d%d%d", &cri[i].a, &cri[i].b, &cri[i].y);
sort(cri + 1, cri + 1 + m, cmp); //按照怨气值排序
for (i = 1; i <= m; i++) { //从怨气值最高的人向下找,两个犯人在同一个监狱就输出这个影响值
g = fa(cri[i].a);
h = fa(cri[i].b);
if (g == h) { //是否已经相连
printf("%d", cri[i].y);
ff = 0;
break;
}
f[h] = fa(cri[i].a + n); //与彼此的补集相连
f[g] = fa(cri[i].b + n);
}
if (ff != 0)
putchar('0');
return 0;
}