题意:有n个人,然后有一系列操作,1号操作:让a和b成为朋友,如果a和b已经是敌人,输出-1。2号操作:让a和b成为敌人,如果a和b已经是朋友,输出-1。3号操作:如果a和b是朋友,输出1否则输出0。4号操作:如果a和b是敌人,输出1否则输出0。
题解:并查集的题目,方法是增加n个点并假设k和n + k是敌人。然后执行1是需要将a和b放在一个集合中,也要将a+n和b+n放到一个集合中,将要在执行2时将b加到a + n的集合中就可以做到让b成为a所有朋友的敌人。
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
const int N = 20005;
int n, pa[N];
int get_parent(int a) {
return a == pa[a] ? a : pa[a] = get_parent(pa[a]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < 2 * n; i++) {
pa[i] = i;
}
int x, a, b;
while (scanf("%d%d%d", &x, &a, &b) && x + a A+ b) {
if (x == 1) {
int px = get_parent(a);
int py = get_parent(b);
int t1 = get_parent(a + n);
int t2 = get_parent(b + n);
if (px != t2 && py != t1) {
pa[px] = py;
pa[t1] = t2;
}
else
printf("-1\n");
}
else if (x == 2) {
int px = get_parent(a);
int py = get_parent(b);
int t1 = get_parent(a + n);
int t2 = get_parent(b + n);
if (px != py) {
pa[t2] = px;
pa[t1] = py;
}
else
printf("-1\n");
}
else if (x == 3) {
int px = get_parent(a);
int py = get_parent(b);
if (px == py)
printf("1\n");
else
printf("0\n");
}
else {
int px = get_parent(a);
int py = get_parent(b);
int t1 = get_parent(a + n);
int t2 = get_parent(b + n);
if (px == t2 || py == t1)
printf("1\n");
else
printf("0\n");
}
}
return 0;
}