Just Repeat（博弈）

题目描述
When Cuber QQ was chatting happily in a QQ group one day, he accidentally noticed that there was a counterfeit of him, who stole his avatar and mimicked his tone, and more excessively, had a nickname “Quber CC”, which was sarcastic to him. So Cuber QQ decided to play a little game with this Quber CC, and their bet was, whoever lost the game would have to do something really humiliating in front of everyone in the QQ group.

The game is like this. It’s a traditional card game. Cuber QQ will play first. Cuber QQ, and his opponent (Quber CC of course), will each possess a hand of cards. There is no number (or rank if you prefer) on the card, but only color (or suit if you prefer). The players play cards alternatively, each player can only play one card in each turn. An additional rule is that, a player must not play a card with the same color as any card which has been played by his/her opponent, but coincidence with a card played by himself/herself is acceptable.

The player who can’t play any card loses. This might due to the fact that he/she has cards but he cannot play any due to the game rules, or he doesn’t have any cards any more. As a game played between civilized people, the game will be played in a completely transparent manner, where Cuber QQ and Quber CC know exactly what’s left in their opponent’s hand.

It’s now a game attracting thousands of eyes, and you decided to invent a predictor whose job is to predict “who will win if both players play smart” to excite the audience.

输入
The first line of the input is a positive integer t, denoting the number of test cases.

Then follows t test cases, each test case starts with space-separated integers n, m, p (1≤n,m≤105, p∈{1,2}). Generally speaking, this should be followed by two lines of integers a1,a2,…,an and b1,b2,…,bm, denoting the colors of Cuber QQ’s hand and Quber CC’s hand, respectively. Unfortunately, as it turns out, the input will be the bottleneck in that case. So we introduce p to deal with this problem.

For p=1, there follows two lines, where the first line is a1,a2,…,an and the second line is b1,b2,…,bm, all space separated and 0≤ai,bi<109.
For p=2, there follows two lines, which are k1,k2,mod (0≤k1,k2<264, 1≤mod≤109) to generate {ai} and {bi}, respectively.
Here are some instructions on how to generate {ai}, {bi} with k1,k2,mod, which you’ve probably seen before, somehow:

unsigned long long k1, k2;
unsigned long long rng() {
unsigned long long k3 = k1, k4 = k2;
k1 = k4;
k3 ^= k3 << 23;
k2 = k3 ^ k4 ^ (k3 >> 17) ^ (k4 >> 26);
return k2 + k4;
}

// generate
read(k1, k2, mod);
for (int i = 0; i < n; ++i)
a[i] = rng() % mod;

read(k1, k2, mod);
for (int i = 0; i < m; ++i)
b[i] = rng() % mod;

Also, the sum of n+m for p=1 does not exceed 5⋅105; the sum of n+m from all test cases does not exceed 107.

输出
For each test case, predict the winner: “Cuber QQ” or “Quber CC”.

样例输入
2
6 7 1
1 1 4 5 1 4
1 9 1 9 8 1 0
10 20 2
1 2 10
1 2 10

样例输出
Cuber QQ
Quber CC

思路
如两人存在完全不同颜色的手牌，则该种手牌不会被禁止使用，当存在相同颜色的手牌，则优先出自己能出的总数与对方能出的总数之和最大的颜色的手牌

代码实现

#include 

using namespace std;
typedef pair P;
typedef unsigned long long ll;
const int N=100005;
const int INF=0x3f3f3f;
const ll mod=1e9;

struct node
{
    int c,s;
    node (int c=0,int s=0): c(c),s(s){}
    bool operator < (const node &b)const
    {
        return c+s>b.c+b.s;
    }
}a[N],b[N],c[N];

ll k1,k2;
ll rng()
{
    ll k3=k1,k4=k2;
    k1=k4;
    k3^=k3<<23;
    k2=k3^k4^(k3>>17)^(k4>>26);
    return k2+k4;
}

int read(node t[N],int n,int p)
{
    int tmp[N];
    if(p==1) for(int i=0;ib[p2].c && p2s2) puts("Cuber QQ");
        else puts("Quber CC");
    }
    return 0;
}