#include <bits/stdc++.h>
#include "keys.h"
using namespace std;
using ll = long long;
using vi = vector<ll>;
#define pb emplace_back
const int mxN = 2005;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size();
int m = u.size();
int p[n] = {};
vector<bool> vis(n), key(n);
for(int x = 0; x < n; ++x) {
vis.assign(n, false);
key.assign(n, false);
vis[x] = true;
key[r[x]] = true;
while(true) {
bool relax = false;
for(int i = 0; i < m; ++i) {
if(key[c[i]]) {
if(vis[u[i]] && !vis[v[i]]) {
vis[v[i]] = true;
key[r[v[i]]] = true;
relax = true;
} else if(vis[v[i]] && !vis[u[i]]) {
vis[u[i]] = true;
key[r[u[i]]] = true;
relax = true;
}
}
}
if(!relax) break;
}
for(int i = 0; i < n; ++i) {
p[x] += (vis[i]);
}
}
ll mn = *min_element(p, p + n);
vector<int> ans(n, 1);
for(int i = 0; i < n; ++i) {
ans[i] = (p[i] == mn);
}
return ans;
}
