1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
| #include <cstdio>
#include <vector>
#include <utility>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ms(a, b) memset((a), (b), sizeof(a))
typedef long long ll;
const int N = 1e3 + 205;
int f[N];
inline int tofind(int x) {
return f[x] == x ? x : f[x] = tofind(f[x]);
}
inline void tojoin(int a, int b) {
f[tofind(a)] = tofind(b);
}
int dp[N][N];
vector<int>ve[N][2];
vector<int>ans;
int m, p, q;
int vis[N];
void solve(){
int n = p + q;
for (int i = 1; i <= 2 * n; ++i) f[i] = i;
char op[10];
for (int i = 0; i < m; ++i) {
int x, y;
scanf("%d%d%s", &x, &y, op);
if (op[0] == 'y') tojoin(x, y), tojoin(x + n, y + n);
else tojoin(x, y + n), tojoin(x + n, y);
}
// 可以不用, 但是放在这里容易理解代码
// for (int i = 1; i <= n; ++i){
// if (tofind(i) == tofind(i + n)){
// puts("no");
// return;
// }
// }
int tot = 0;
ms(vis, 0);
for (int i = 1; i <= n; ++i){
if (vis[i]) continue;
++tot;
ve[tot][0].clear();
ve[tot][1].clear();
int f0 = tofind(i), f1 = tofind(i + n);
for (int j = 1; j <= n; ++j){
if (vis[j]) continue;
if (tofind(j) == f0) ve[tot][0].push_back(j), vis[j] = 1;
if (tofind(j) == f1) ve[tot][1].push_back(j), vis[j] = 1;
}
}
ms(dp, 0); dp[0][0] = 1;
for (int i = 1; i <= tot; ++i){
int s0 = ve[i][0].size();
int s1 = ve[i][1].size();
// for (int j = p; j >= 0; --j){ // 记住 这里不是1 是0!!!!!!!
// if (j >= s0) dp[i][j] += dp[i - 1][j - s0];
// if (j >= s1) dp[i][j] += dp[i - 1][j - s1];
// }
// 建议这么写
for (int j = p; j >= s0; --j) dp[i][j] += dp[i - 1][j - s0];
for (int j = p; j >= s1; --j) dp[i][j] += dp[i - 1][j - s1];
}
if (dp[tot][p] != 1) puts("no");
else {
ans.clear();
int pre = p;
for (int i = tot; i >= 1; --i){
int s0 = ve[i][0].size();
if (pre >= s0 && dp[i - 1][pre - s0] == 1){
pre -= s0;
for (int j = 0; j < s0; ++j) ans.push_back(ve[i][0][j]);
continue;
}
int s1 = ve[i][1].size();
if (pre >= s1 && dp[i - 1][pre - s1] == 1){
pre -= s1;
for (int j = 0; j < s1; ++j) ans.push_back(ve[i][1][j]);
}
}
sort(ans.begin(), ans.end());
int sz = ans.size();
for (int i = 0; i < sz; ++i)
printf("%d\n", ans[i]);
puts("end");
}
}
int main() {
while(cin >> m >> p >> q && (m || p || q)) solve();
return 0;
}
/*
2 1 27
22 25 yes
5 27 yes
0 0 0
no
* */
|