Bitwise Exclusive-OR Sequence[种类并查集]

Bitwise Exclusive-OR Sequence
题意：有n个数，m个关系
每个关系中给出一个u,v,w使得 u XOR v = w, 求n个数相加的最小值

#include<bits/stdc++.h>
using namespace std;
//#define int long long
const int N = 1e5 + 10;
int f[N << 1], vis[N << 1], sum[N << 1];

struct nod{
    int u, v, w;
}no[N << 2];


int find(int x){
    if(x != f[x]){
        return f[x] = find(f[x]);
    }
    return x;
}


void init(int n){
    for(int i = 1; i <= n; i++){
        f[i] = i;
        f[i + n] = i + n;
        sum[i] = 1;
        sum[i + n] = 0;
        vis[i] = 0;
        vis[i + n] = 0;
    }
}

void merge(int a, int b){
    sum[a] += sum[b];
    f[b] = a;
}


void solve(){
    int n, m;
    cin >> n >> m;

    for(int i = 1; i <= m; i++){
        cin >> no[i].u >> no[i].v >> no[i].w;
    }

    long long ans = 0;
    for(int i = 0; i < 30; i++){
        init(n);
        for(int j = 1; j <= m; j++){
            int fx = find(no[j].u);
            int fy = find(no[j].v);

            int fx1 = find(no[j].u + n);
            int fy1 = find(no[j].v + n);

            if((no[j].w >> i) & 1){
                //当前位不同
                if(fx == fy){
                    //前面已经判定两个数当前位相同
                    cout << -1 << "\n";
                    return ;
                }
                if(fx == fy1){
                    //前面已经判定两个数当前位不同
                    continue;
                }

                //合并
                merge(fx, fy1);
                merge(fy, fx1);
            }else{
                if(fx == fy1){
                    cout << -1 << "\n";
                    return ;
                }
                if(fx == fy){
                    continue;
                }

                merge(fx, fy);
                merge(fx1, fy1);
            }
        }
        for(int j = 1; j <= n; j++){
            int temp = find(j), temp1 = find(j + n);
            if(vis[temp] || vis[temp1]){
                continue;
            }
            vis[temp1] = vis[temp] = 1;
            ans += 1ll * min(sum[temp], sum[temp1]) * (1 << i);
        }
    }
    cout << ans;
}
signed main(){
    int t = 1;
//     cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

另一种方法

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10;

struct nod{
	int to, nex, w;
}no[N << 2];

int head[N], cnt;
void add(int u, int v, int w){
	no[cnt].to = v;
	no[cnt].w = w;
	no[cnt].nex = head[u];
	head[u] = cnt++;
}

int vis[N << 2];
//记录走过的路径
int vis1[N];
//记录计算过的点 
int sum[N][2];
//记录0和1分别有多少 
int temp[N];
//记录经过的点的值 

int dfs(int x){
	
	for(int i = 0; i < 30; i++){
		sum[i][temp[x] >> i & 1] ++;
		//记录当前位0和1分别有多少 
	}
	for(int e = head[x]; e >= 0; e = no[e].nex){
		if(vis[e]){
			continue;
		}
		vis[e] = 1;
		vis[e ^ 1] = 1;
		//走过当前路径意味着相反的路径也不用走了 
		
		if(vis1[no[e].to]){
			if((temp[x] ^ temp[no[e].to]) != no[e].w){
				//如果要走的点已经走过了，判断是否跟之前矛盾 
				return 1;
			} 
			continue;
		}
		
		temp[no[e].to] = temp[x] ^ no[e].w;
		vis1[no[e].to] = 1;
		if(dfs(no[e].to)){
			return 1;
		}
	}
	
	return 0;
}
void solve(){
	
	int n, m;
	cin >> n >> m;
    for(int i = 1; i <= n; i++){
        head[i] = -1;
    }
	for(int i = 1; i <= m; i++){
		int u, v, w;
		cin >> u >> v >> w;
		add(u, v, w);
		add(v, u, w);
	}
	
	//设第一个进去的点x为0，计算每一位的0和1数量，如果在某一位上0的数量少，则将x的该位设为1，此时 原1变为0，原0变为1 
	int ans = 0;
	for(int i = 1; i <= n; i++){
		if(vis1[i]){
			continue;
		}
		vis1[i] = 1;
		if(dfs(i)){
			cout << "-1\n";
			return ;
		}
		
		for(int j = 0; j < 30; j++){
			ans += min(sum[j][0], sum[j][1]) << j;
			sum[j][0] = sum[j][1] = 0;
		}
	}
	cout << ans;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	return 0;
}