传送门:QAQ
题意:告诉你有a个好人,b个坏人,然后有n句话,问你是否能从n句话中判断唯一一种情况,哪些是好人,哪些是坏人。让你输出好人,否则输出“no”
思路:首先如果一个人说一个人是好人,那他们的关系是相同的,如果一个人说一个人是坏人,那么他们关系是相反的。所以我们可以用带权并查集来维护有关系的人,那么一个集合中就有关系相同,关系相反的集合。然后再用dp去判断a个好人,b个坏人的方案数是否为1即可。
代码:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<stack>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;
int dp[1100][610];
int father[600];
int ran[600];
int vis[600];
int num[600][5];
int n, hao, huai;
vector<int>vt;
int find(int x) {
if (x != father[x]) {
int temp = father[x];
int px = find(father[x]);
ran[x]^= ran[temp];
father[x] = px;
}
return father[x];
}
void unio(int a, int b, int k) {
int x1 = find(a);
int y1 = find(b);
if (x1 != y1) {
father[x1] = y1;
ran[x1] = ran[a]^ran[b] ^ k;
}
}
void init() {
for (int i = 0; i <= hao+huai; i++) {
father[i] = i;
ran[i] = 0;
num[i][0] = num[i][1] = 0;
}
vt.clear();
memset(dp, 0, sizeof(dp));
memset(vis, 0, sizeof(vis));
}
int main(void) {
while (scanf("%d%d%d", &n, &hao, &huai) != EOF) {
if (n == 0 && hao == 0 && huai == 0) {
break;
}
init();
for (int i = 0; i < n; i++) {
int a, b;
char ch[10];
scanf("%d%d%s", &a, &b, ch);
if (ch[0] == 'y') {
unio(a, b, 0);
}
else if (ch[0] == 'n') {
unio(a, b, 1);
}
}
vt.push_back(-1);
for (int i = 1; i <= hao + huai; i++) {
if (find(i) == i&&!vis[i]) {
vis[i] = 1;
vt.push_back(i);
}
}
for (int i = 1; i <= hao + huai; i++) {
int x1 = find(i);
num[x1][ran[i]]++;
}
dp[0][0] = 1;
for (int i = 1; i < vt.size(); i++) {
for (int j = hao + huai; j >= num[vt[i]][0]; j--) {
if (dp[i - 1][j - num[vt[i]][0]]) {
dp[i][j] += dp[i - 1][j - num[vt[i]][0]];
}
}
for (int j = hao + huai; j >= num[vt[i]][1]; j--) {
if (dp[i - 1][j - num[vt[i]][1]]) {
dp[i][j] += dp[i - 1][j - num[vt[i]][1]];
}
}
}
if (dp[vt.size()-1][hao] != 1) {
printf("no\n");
}
else {
int tot = hao;
vector<int>qq;
for (int i = vt.size()-1; i >= 1; i--) {
if (dp[i-1][tot - num[vt[i]][0]] == 1) {
tot = tot - num[vt[i]][0];
for (int z = 1; z <= hao + huai; z++) {
if (find(z) == vt[i] && ran[z] == 0) {
qq.push_back(z);
}
}
}
else if (dp[i-1][tot - num[vt[i]][1]] == 1) {
tot = tot - num[vt[i]][1];
for (int z = 1; z <= hao + huai; z++) {
if (find(z) == vt[i] && ran[z] == 1) {
qq.push_back(z);
}
}
}
}
sort(qq.begin(), qq.end());
for (int i = 0; i < qq.size(); i++) {
printf("%d\n", qq[i]);
}
printf("end\n");
}
}
return 0;
}