P1525 关押罪犯

并查集，自己的思路和食物链这题非常的像，把在并查集中和父亲关系为 1 记为和父亲节点在同一个集合里面，0记为不在同一个集合里面，类似的可以推出一个节点和爷爷节点的关系为
value[now] = (value[father[now]] + value[now]) % 2;
对边排序，从大的边开始，尽量边链接的两个点不在一个集合里面，如果在，判断关系是不是 1 ，如果是就和 ans 变量取max，最后输出ans即可

代码如下

	#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> Pi;
typedef unsigned long long ULL;
int gcd(int a,int b){if (b == 0) return a; return gcd(b , a%b);}
int lcm(int a, int b){ return a/gcd(a,b)*b;}
inline int read(){
    int f = 1, x = 0;char ch = getchar();
    while (ch > '9' || ch < '0'){if (ch == '-')f = -f;ch = getchar();}
    while (ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();}
    return x * f;
}
const int maxn = 1e5 + 10;
int pre[maxn],value[maxn];
struct _edge {
    int u,v,w;
}edge[maxn];
int cmp(_edge a,_edge b){
    return a.w < b.w;
}
int find(int x){
    if (pre[x] == x) return x;
    int root = find(pre[x]);
    value[x] = (value[pre[x]] + value[x]) % 2;
    pre[x] = root;
    return root;
}
int main(){
    //freopen("/Users/chutong/data.txt", "r", stdin);
    int n = read(),m = read(),ans = 0;
    for (int i=1; i<=n; i++) {
        pre[i] = i;
    }
    for (int i=1; i<=m; i++) {
        edge[i].u = read();
        edge[i].v = read();
        edge[i].w = read();
    }
    sort(edge+1, edge+m+1, cmp);
    for (int i=m; i>=1; i--) {
        int a = edge[i].u,b = edge[i].v,c = edge[i].w;
        int fa = find(a),fb = find(b);
        if (fa != fb){
            value[fa] = ((value[a] + 1) % 2 + value[b]) % 2;
            pre[fa] = fb;
        }else{
            int res = (value[a] + value[b]) % 2;
            if (res == 0) ans = max(ans,c);
        }
    }
    cout << ans << endl;
    return 0;
}