中南大学第十二届大学生程序设计竞赛 D树上异或性质

最新推荐文章于 2024-04-02 14:01:17 发布

做不完的ACM

最新推荐文章于 2024-04-02 14:01:17 发布

阅读量205

点赞数

分类专栏：很套路的题树上异或和性质树形DP

本文链接：https://blog.csdn.net/qq_36876305/article/details/80060491

版权

题目链接：http://acm.csu.edu.cn/csuoj/problemset/problem?pid=2082

Description

The environment of Beijing is insufferable as you know.You have to wear a mask when you go outside because of the smog. Xiaoming is new here,he has to get accustomed to the lifestyle of beijing.So at the first day he arrived there,he decide to go around to see what the whole city like.He choose n destination.But you know,the road in beijing is complex,so a thought come into xiaoming's mind :why not use "MST" algorithm to link all destination?So after a few minute,xiaoming get a map with n destination and n-1 road between them. We can define Path(u,v) as the path in the tree that doesn't pass a node twice between node u and v.What's more,if we define E(u,v) is the set of edge that appear in Path(u,v),the distance between node u and v,we can define it as D(u,v), will be equal to the sum of exclusive-or of these edge. Xiaoming want to know