题目链接:https://codeforces.com/problemset/problem/1244/D
类似二分图,这里有的要求是,任意连续的三个节点,颜色不能一样,那么只有当这棵树为一条链的时候才符合要求。颜色分别用1,2,3来表示。从度数为1的节点作为根节点开始,如果确定了最开始选的两种颜色,则第三种颜色必定为6-前两种颜色之和,所以前两种颜色的选择就决定了全部的颜色选择。一共六种情况,所以是O(n)的复杂度。
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, p[N], ansp[N], du[N];
vector<int> e[N];
long long c[5][N];
void dfs(int fa, int m, long long& tmp) {
tmp += c[p[m]][m];
if (e[m].size() == 1) return;
if (e[m][0] == fa) {
p[e[m][1]] = 6 - p[fa] - p[m];
dfs(m, e[m][1], tmp);
}
else {
p[e[m][0]] = 6 - p[fa] - p[m];
dfs(m, e[m][0], tmp);
}
}
int main(void) {
// freopen("in.txt", "r", stdin);
scanf("%d", &n);
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= n; j++)
scanf("%lld", &c[i][j]);
bool ok = true;
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
e[u].push_back(v);
e[v].push_back(u);
du[u]++;
du[v]++;
if (du[u] > 2 || du[v] > 2) ok = false;
}
if (!ok) {
puts("-1");
return 0;
}
int root = 1;
while (du[root] != 1) root++;
int start = e[root][0];
long long ans = 1e15;
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= 3; j++)
if (i != j) {
long long tmp = c[i][root];
p[root] = i;
p[start] = j;
dfs(root, start, tmp);
if (ans > tmp) {
ans = tmp;
for (int i = 1; i <= n; i++)
ansp[i] = p[i];
}
}
printf("%lld\n", ans);
for (int i = 1; i <= n; i++)
printf("%d%c", ansp[i], i == n ? '\n' : ' ');
return 0;
}