Codeforces Round #732 (Div. 2) ---- B

AquaMoon had nn strings of length mm each. nn is an odd number.

When AquaMoon was gone, Cirno tried to pair these nn strings together. After making \frac{n-1}{2}2n−1​ pairs, she found out that there was exactly one string without the pair!

In her rage, she disrupted each pair of strings. For each pair, she selected some positions (at least 11 and at most mm) and swapped the letters in the two strings of this pair at the selected positions.

For example, if m = 6m=6 and two strings "abcdef" and "xyzklm" are in one pair and Cirno selected positions 22, 33 and 66 she will swap 'b' with 'y', 'c' with 'z' and 'f' with 'm'. The resulting strings will be "ayzdem" and "xbcklf".

Cirno then stole away the string without pair and shuffled all remaining strings in arbitrary order.

AquaMoon found the remaining n-1n−1 strings in complete disarray. Also, she remembers the initial nn strings. She wants to know which string was stolen, but she is not good at programming. Can you help her?

Input

This problem is made as interactive. It means, that your solution will read the input, given by the interactor. But the interactor will give you the full input at the beginning and after that, you should print the answer. So you should solve the problem, like as you solve the usual, non-interactive problem because you won't have any interaction process. The only thing you should not forget is to flush the output buffer, after printing the answer. Otherwise, you can get an "Idleness limit exceeded" verdict. Refer to the interactive problems guide for the detailed information about flushing the output buffer.

The input consists of multiple test cases. The first line contains a single integer tt (1 \leq t \leq 1001≤t≤100) — the number of test cases.

The first line of each test case contains two integers nn, mm (1 \leq n \leq 10^51≤n≤105, 1 \leq m \leq 10^51≤m≤105) — the number of strings and the length of each string, respectively.

The next nn lines each contain a string with length mm, describing the original nn strings. All string consists of lowercase Latin letters.

The next n-1n−1 lines each contain a string with length mm, describing the strings after Cirno exchanged and reordered them.

It is guaranteed that nn is odd and that the sum of n \cdot mn⋅m over all test cases does not exceed 10^5105.

Hack format:

The first line should contain a single integer tt. After that tt test cases should follow in the following format:

The first line should contain two integers nn and mm.

The following nn lines should contain nn strings of length mm, describing the original strings.

The following \frac{n-1}{2}2n−1​ lines should describe the pairs. They should contain, in the following order: the index of the first string ii (1 \leq i \leq n1≤i≤n), the index of the second string jj (1 \leq j \leq n1≤j≤n, i \neq ji=j), the number of exchanged positions kk (1 \leq k \leq m1≤k≤m), and the list of kk positions that are exchanged (kk distinct indices from 11 to mm in any order).

The final line should contain a permutation of integers from 11 to nn, describing the way the strings should be reordered. The strings will be placed in the order indices placed in this permutation, the stolen string index will be ignored.

Output

For each test case print a single line with the stolen string.

Sample 1

Inputcopy	Outputcopy
3 3 5 aaaaa bbbbb ccccc aaaaa bbbbb 3 4 aaaa bbbb cccc aabb bbaa 5 6 abcdef uuuuuu kekeke ekekek xyzklm xbcklf eueueu ayzdem ukukuk	ccccc cccc kekeke

Note

In the first test case, "aaaaa" and "bbbbb" exchanged all positions, and "ccccc" is the stolen string.

In the second test case, "aaaa" and "bbbb" exchanged two first positions, and "cccc" is the stolen string.

This is the first test in the hack format:

3
3 5
aaaaa
bbbbb
ccccc
1 2 5 1 2 3 4 5
2 1 3
3 4
aaaa
bbbb
cccc
1 2 2 1 2
2 1 3
5 6
abcdef
uuuuuu
kekeke
ekekek
xyzklm
1 5 3 2 3 6
2 4 3 2 4 6
5 4 1 2 3

题目大意：

奇数个字符串，拿走其中的一串。然后将其中n − 1 个串两两配对，配对的串会随机交换相同位置的字符，给出配对完后被打乱顺序的n − 1个串，要你找出拿走的是那一串。

解题思路：

由于不管怎么配对怎么变，每个字符交换后的下标都是不变的，只是变了所在的字符串。

所以可以记录每一位的字符总和，再减去还在的。

最后记得转化成字符类型输出！！！

AC代码如下：

#include <bits/stdc++.h>
using namespace std;

const int N = 100010;

int t;
int n, m;
string s[N], c[N];

int main()
{
    cin >> t;
    while(t -- )
    {
        cin >> n >> m;
        for(int i = 1; i <= n; i ++ ) cin >> s[i];
        for(int i = 1; i <= n - 1; i ++ ) cin >> c[i];
        
        for(int i = 0; i < m; i ++ )
        {
            int sum1 = 0, sum2 = 0;
            for(int j = 1; j <= n; j ++ )
                sum1 += s[j][i];
                
            for(int j = 1; j <= n - 1; j ++ )
                sum2 += c[j][i];
                
            //cout << sum1 - sum2 << " ";
                
            char ans = (char)sum1 - sum2;
            
            cout << ans;
        }
        cout << endl;
    }
    return 0;
}