#include <bits/stdc++.h>
using namespace std;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size(), m = u.size();
vector<vector<int>> edge(n);
for (int i = 0; i < m; i++) {
if (r[u[i]] == c[i]) edge[u[i]].push_back(v[i]);
if (r[v[i]] == c[i]) edge[v[i]].push_back(u[i]);
}
vector<int> p(n);
for (int i = 0; i < n; i++) {
queue<int> bfs;
vector<int> vis(n);
bfs.push(i);
while (!bfs.empty()) {
int u = bfs.front();
bfs.pop();
if (vis[u]) continue;
vis[u] = true;
for (int v : edge[u]) {
bfs.push(v);
}
}
p[i] = accumulate(vis.begin(), vis.end(), 0);
}
int min_p = *min_element(p.begin(), p.end());
vector<int> ret(n);
for (int i = 0; i < n; i++) ret[i] = (p[i] == min_p);
return ret;
}
