#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
vector<pair<int,int>> ma[N];
vector<int> ct[N];
bool hv[N],vis[N];
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
int n=r.size();
vector<int> ans(r.size());
for(int j=0;j<u.size();j++)
{
ma[u[j]].push_back({c[j],v[j]});
ma[v[j]].push_back({c[j],u[j]});
}
int mi=n;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
vis[j]=hv[j]=0;
ct[j].clear();
}
queue<int> q;
q.push(i);
hv[r[i]]=1;
vis[i]=1;
while(q.size())
{
int x=q.front();
q.pop();
ans[i]++;
for(auto y:ct[r[x]])
{
if(!vis[y])
{
q.push(y);
hv[r[y]]=1;
vis[y]=1;
}
}
for(auto [w,y]:ma[x])
{
if(hv[w] and !vis[y])
{
q.push(y);
hv[r[y]]=1;
vis[y]=1;
}
if(!hv[w])ct[w].push_back(y);
}
}
mi=min(mi,ans[i]);
}
for(int j=0;j<n;j++)ans[j]=(ans[j]==mi);
return ans;
}
