#include <bits/stdc++.h>
struct Dsu {
std::vector <int> p;
std::vector <int> size;
Dsu(int s) {
p.resize(s);
std::iota(p.begin(), p.end(), 0);
size.resize(s, 1);
}
int find(int v) {
return v == p[v] ? v : (p[v] = find(p[v]));
}
void unite(int u, int v) {
if ((u = find(u)) == (v = find(v))) {
return;
}
if (size[u] > size[v]) {
p[v] = u;
} else {
p[u] = v;
}
}
};
struct Edge {
int u, v, c;
};
int n, m;
std::vector <Edge> ed;
std::vector <std::vector <int>> g;
std::vector <int> p;
Dsu dsu(0), tree(0);
std::vector <int> r;
bool go() {
std::vector <std::vector <int>> in(n);
for (int i = 0; i < n; i++) {
in[dsu.find(i)].push_back(i);
}
std::vector <std::vector <int>> ed_of(n);
bool did = false;
for (int j = 0; j < n; j++) {
int i = j;
if (dsu.find(i) != i || p[i] != -1) {
continue;
}
for (int v : in[i]) {
for (int x : g[v]) {
ed_of[ed[x].c].push_back(v ^ ed[x].v ^ ed[x].u);
}
}
std::vector <int> eds;
for (int x : in[i]) {
for (int y : ed_of[r[x]]) {
eds.push_back(y);
}
ed_of[r[x]].clear();
}
for (int x : eds) {
if (dsu.find(x) == i) {
continue;
}
did = true;
if (tree.find(x) == tree.find(i)) {
int to = dsu.find(x);
while (i != to) {
int new_to = dsu.find(p[to]);
p[i] = p[to] = p[i];
dsu.unite(to, i);
i = dsu.find(i);
to = new_to;
}
} else {
p[i] = dsu.find(x);
tree.unite(x, i);
break;
}
}
for (int v : in[i]) {
for (int x : g[v]) {
ed_of[ed[x].c].clear();
}
}
}
return did;
}
std::vector <int> find_reachable(std::vector <int> _r, std::vector <int> u, std::vector <int> v, std::vector <int> c) {
r = _r;
n = r.size();
m = c.size();
ed.resize(m);
g.resize(n);
for (int i = 0; i < m; i++) {
g[u[i]].push_back(i);
g[v[i]].push_back(i);
ed[i] = { u[i], v[i], c[i] };
}
p.resize(n, -1);
dsu = Dsu(n);
tree = Dsu(n);
int cnt = 0;
while (go() && ++cnt < 125);// assert(++cnt < 100);
std::vector <int> ans(n, 0);
for (int i = 0; i < n; i++) {
ans[dsu.find(i)] += p[dsu.find(i)] == -1;
}
int res = 1 << 30;
for (int x : ans) {
if (x) {
res = std::min(res, x);
}
}
std::vector <int> ret(n, 0);
for (int i = 0; i < n; i++) {
if (ans[dsu.find(i)] == res) {
ret[i] = 1;
}
}
return ret;
}
