2018 Multi-University Training Contest 3 Problem F. Grab The Tree(博弈论&二进制运算)
Problem Description
Little Q and Little T are playing a game on a tree. There are n vertices on the tree, labeled by 1,2,...,n, connected by n−1 bidirectional edges. The i-th vertex has the value of...
原创
2018-07-31 17:09:41 ·
252 阅读 ·
0 评论