AcWing 239. 奇偶游戏
①并查集做法:多维护一个d数组,d[i]标识从root到i节点1的个数,之后读入每个问题,对于每个节点进行离散化存储,对已有关系的节点,判断节点之间的1的数量和原来维持的数量是否冲突,如果冲突就输出答案,否则继续
#include<bits/stdc++.h>
using namespace std;
const int N = 5010;
int n, m;
int d[N]; //维护i到root1的个数
int p[N];
unordered_map<int, int>S; //哈希表
int ans;
int get(int x){
if(S.count(x) == 0) S[x] = ++ n;
return S[x];
}
int find(int x){
if(x != p[x]){
int root = find(p[x]);
d[x] += d[p[x]];
p[x] = root;
}
return p[x];
}
int main()
{
cin>>n>>m;
n = 0;
for(int i = 0; i < N; i ++ ) p[i] = i;
ans = m;
for(int i = 1; i <= m; i ++ ){
int a, b;
int t = 0;
string type;
cin>>a>>b>>type;
a = get(a - 1), b = get(b);
if(type == "odd") t = 1;
int fa = find(a), fb = find(b);
if(fa == fb){
if(((d[a] ^ d[b]) % 2 + 2) % 2 != t){
ans = i - 1;
break;
}
}
else{
p[fa] = fb;
d[fa] = d[a] ^ d[b] ^ t;
}
}
cout<<ans<<endl;
return 0;
}
②扩展域解法:在原离散化之后的a的基础上,再加上一个B表示a的偶数情况(b同理),之后用根据关系将同为偶数时加在一个集合内,如果发现奇偶性冲突时就记录答案,退出循环,输出。
#include<bits/stdc++.h>
using namespace std;
const int N = 4e4 + 10, B = N / 2;
int n, m;
int p[N];
int ans;
unordered_map<int, int>S;
int get(int x){
if(S.count(x) == 0) S[x] = ++ n;
return S[x];
}
int find(int x){
if(x != p[x]) p[x] = find(p[x]);
return p[x];
}
int main()
{
cin>>n>>m;
n = 0;
for(int i = 1; i <= N; i ++ ) p[i] = i;
ans = m;
for(int i = 1; i <= m; i ++ ){
int a, b;
string type;
cin>>a>>b>>type;
a = get(a - 1), b = get(b);
if(type == "even"){ //偶数
if(find(a + B) == find(b)){
ans = i - 1;
break;
}
p[find(a)] = find(b);
p[find(a + B)] = find(b + B);
}
else{ //奇数
if(find(a) == find(b)){
ans = i - 1;
break;
}
p[find(a + B)] = find(b);
p[find(a)] = find(b + B);
}
}
cout<<ans<<endl;
return 0;
}