Problem F. Grab The Tree

最新推荐文章于 2019-09-13 10:57:28 发布

原创最新推荐文章于 2019-09-13 10:57:28 发布 · 299 阅读

0 ·

CC 4.0 BY-SA版权

2018 Multi-University Training 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个基于树形结构的游戏策略问题“GrabTheTree”。游戏由LittleQ和LittleT两位玩家进行，目标是在不选择相邻节点的情况下，通过选择树上的节点来最大化各自得分，得分计算方式为所选节点值的比特位异或和。文章提供了输入输出格式、样例，并附带了一段C++代码实现，用于预测最终胜者。

Problem F. Grab The Tree

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 2004 Accepted Submission(s): 911

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 wi.
In this game, Little Q needs to grab some vertices on the tree. He can select any number of vertices to grab, but he is not allowed to grab both vertices that are adjacent on the tree. That is, if there is an edge between x and y, he can't grab both x and y. After Q's move, Little T will grab all of the rest vertices. So when the game finishes, every vertex will be occupied by either Q or T.
The final score of each player is the bitwise XOR sum of his choosen vertices' value. The one who has the higher score will win the game. It is also possible for the game to end in a draw. Assume they all will play optimally, please write a program to predict the result.

Input

The first line of the input contains an integer T(1≤T≤20), denoting the number of test cases.
In each test case, there is one integer n(1≤n≤100000) in the first line, denoting the number of vertices.
In the next line, there are n integers w1,w2,...,wn(1≤wi≤109), denoting the value of each vertex.
For the next n−1 lines, each line contains two integers u and v, denoting a bidirectional edge between vertex u and v.

Output

For each test case, print a single line containing a word, denoting the result. If Q wins, please print Q. If T wins, please print T. And if the game ends in a draw, please print D.

Sample Input

1 3 2 2 2 1 2 1 3

Sample Output

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a;
int main(){
    int t,n,sum;
    int u,v;
    cin>>t;
    while(t--){
        sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a);
            sum^=a;
        }
        for(int i=0;i<n-1;i++)
            scanf("%d%d",&u,&v);

        if(sum==0)puts("D");
        else puts("Q");
    }
    return 0;
}