D. MEX Tree
题目链接
outputstandard output
You are given a tree with n nodes, numerated from 0 to n−1. For each k between 0 and n, inclusive, you have to count the number of unordered pairs (u,v), u≠v, such that the MEX of all the node labels in the shortest path from u t
原创
2021-05-25 19:26:10 ·
220 阅读 ·
0 评论