[USACO 19DEC] Milk Visits S（LCA） | 错题本

题目

[USACO 19DEC] Milk Visits S

分析

记录到根路径上颜色数，倍增求 LCA 即可判断是否路径上全是他想要的颜色。

代码

#include <bits/stdc++.h>

const int MAXN = 100000;
const int LOG = 16;

int N, M;
char S[MAXN + 5];
std::vector<int> G[MAXN + 5];

int Dep[MAXN + 5];
int Anc[MAXN + 5][LOG + 5];
int Cnt[2][MAXN + 5];

void Dfs(int u, int f) {
	Dep[u] = Dep[Anc[u][0] = f] + 1;
	Cnt[0][u] = Cnt[0][f] + (S[u] == 'H');
	Cnt[1][u] = Cnt[1][f] + (S[u] == 'G');
	for (int v: G[u])
		if (v != f)
			Dfs(v, u);
}

int GetLCA(int u, int v) {
	if (Dep[u] < Dep[v])
		std::swap(u, v);
	int k = Dep[u] - Dep[v];
	for (int i = LOG; i >= 0; i--)
		if (k >> i & 1)
			u = Anc[u][i];
	if (u == v) return u;
	for (int i = LOG; i >= 0; i--)
		if (Anc[u][i] != Anc[v][i])
			u = Anc[u][i], v = Anc[v][i];
	return Anc[u][0];
}

int main() {
	scanf("%d%d", &N, &M);
	scanf("%s", S + 1);
	for (int i = 1; i < N; i++) {
		int u, v; scanf("%d%d", &u, &v);
		G[u].push_back(v);
		G[v].push_back(u);
	}
	Dfs(1, 0);
	for (int j = 1; j <= LOG; j++)
		for (int i = 1; i <= N; i++)
			Anc[i][j] = Anc[Anc[i][j - 1]][j - 1];
	while (M--) {
		int u, v; char o[2];
		scanf("%d%d%s", &u, &v, o);
		int LCA = GetLCA(u, v), *P = Cnt[o[0] == 'G'];
		putchar((!!(P[u] - P[Anc[LCA][0]] + P[v] - P[LCA])) + '0');
	}
	return 0;
}