Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[CF342E]Xenia and Tree | K-D Space #22

Open
EndSaH opened this issue Sep 17, 2019 · 0 comments
Open

[CF342E]Xenia and Tree | K-D Space #22

EndSaH opened this issue Sep 17, 2019 · 0 comments

Comments

@EndSaH
Copy link
Owner

EndSaH commented Sep 17, 2019

https://endsah.cf/blog/CF342E-Xenia-and-Tree/#more

Description给定一棵 $n$ 个节点的树,初始时 1 号节点为红色,其余为蓝色。 要求支持如下操作: 将一个节点变为红色。 询问节点 $u$ 到最近红色节点的距离。 共 $q$ 次操作。 $$1 \le n, q \le 10 ^5$$

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant