133 lines
2.7 KiB
C++
133 lines
2.7 KiB
C++
/* Problem URL: https://codeforces.com/contest/2065/problem/F */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int t;
|
|
cin >> t;
|
|
while (t--) {
|
|
int n;
|
|
cin >> n;
|
|
|
|
vi color(n + 1);
|
|
rep(i, n) {
|
|
cin >> color[i + 1];
|
|
}
|
|
|
|
vvi graph(n + 1);
|
|
rep(i, n - 1) {
|
|
int a, b;
|
|
cin >> a >> b;
|
|
|
|
graph[a].push_back(b);
|
|
graph[b].push_back(a);
|
|
}
|
|
|
|
vi parent(n + 1);
|
|
|
|
string ans(n, '0');
|
|
function<void(int, int)> dfs = [&](int i, int p){
|
|
if (color[i] == color[p]) {
|
|
ans[color[i] - 1] = '1';
|
|
}
|
|
|
|
if (color[i] == color[parent[p]]) {
|
|
ans[color[i] - 1] = '1';
|
|
}
|
|
|
|
parent[i] = p;
|
|
|
|
map<int, int> count;
|
|
for (auto j : graph[i]) {
|
|
if (j == p) {
|
|
continue;
|
|
}
|
|
|
|
count[color[j]]++;
|
|
dfs(j, i);
|
|
}
|
|
|
|
for (auto &i : count) {
|
|
if (i.second >= 2) {
|
|
ans[i.first - 1] = '1';
|
|
}
|
|
}
|
|
};
|
|
|
|
dfs(1, 0);
|
|
|
|
cout << ans << '\n';
|
|
}
|
|
}
|