HDU 6324 Problem F. Grab The Tree (规律) ps:贼像树形dp的技巧题

Problem F. Grab The Tree

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

 

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

Q

 

 

Source

2018 Multi-University Training Contest 3

 

 

Recommend

chendu   |   We have carefully selected several similar problems for you:  6331 6330 6329 6328 6327 

 

 

Statistic | Submit | Discuss | Note

#include<iostream>
#include<algorithm>
#include<string>
#include<map>//int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};
#include<set>//int gcd(int a,int b){return b?gcd(b,a%b):a;}
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#define mod 1e9+7
#define ll long long
#define maxn 100005
#define MAX 1000000000
#define ms memset
using namespace std;

int val[maxn];
vector<int> sons[maxn];
int n,a,b;
int sum,maxv;
int f[maxn][2];
/*
题目大意：一棵树选个独立集，
选的权重异或和如果比剩余的异或和大则Q赢，否则T赢，
有可能平局的出现。

对于所有权重的异或和，只要博取到该异或和二进制表达的最高为即可，
即如果有最高的1的话则第一步躺赢。
因为位重的性质，异或和为零的时候平局


*/

int main()
{
    int t;scanf("%d",&t);
    while(t--)
    {
        sum=0,maxv=-1;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&val[i]);
            sum^=val[i];
            maxv=max(maxv,val[i]);
        }

        for(int i=1;i<n;i++)    scanf("%d%d",&a,&b);
        if(maxv>(sum^maxv)) puts("Q");
        else if(maxv<(sum^maxv)) puts("T");
        else puts("D");
    }
    return 0;
}