Codeforces Round #732 (Div. 2) B. AquaMoon and Stolen String

B. AquaMoon and Stolen String

Description

AquaMoon had n strings of length m each. n is an odd number.

When AquaMoon was gone, Cirno tried to pair these n strings together. After making n−12 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 1 and at most m) and swapped the
letters in the two strings of this pair at the selected positions.

For example, if m=6 and two strings “abcdef” and “xyzklm” are in one pair and Cirno selected positions 2, 3 and 6 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−1 strings in complete disarray. Also, she remembers the initial n 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 t (1≤t≤100) — the number of test cases.

The first line of each test case contains two integers n, m (1≤n≤105, 1≤m≤105) — the number of strings and the length of
each string, respectively.

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

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

It is guaranteed that n is odd and that the sum of n⋅m over all test cases does not exceed 10^5.

Hack format:

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

The first line should contain two integers n and m.

The following n lines should contain n strings of length m, describing the original strings.

The following n−12 lines should describe the pairs. They should contain, in the following order: the index of the first string i (1≤i≤n),
the index of the second string j (1≤j≤n, i≠j), the number of exchanged positions k (1≤k≤m), and the list of k positions that
are exchanged (k distinct indices from 1 to m in any order).

The final line should contain a permutation of integers from 1 to n, 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.

Example
input

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

output

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个长度为m的字符串，出题人将选中任意对字符串，交换他们部分相同位置的字母，同时移除一个没有修改过的字符串。接着题目会给出n - 1个修改后的字符串，请你找出哪一个字符串被移除了。

题解：

因为字符串字符的修改只会在相同位置，所以我们只需要将原始字符串每一列的字符分别放到map中，再将后面给出的字符串每一列的所有字符从之前的map中移除，这样map中的每一列都只会剩一个字符，从左到右输出就是被移除的字符串了。

AC代码:

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f;
string a[N], b[N];
typedef pair<char, ll> PAIR;
bool cmp(const PAIR& l, const PAIR& r) { // 按照字母个数从大到小排序 
	return l.second > r.second;
}
int main() {
	ios::sync_with_stdio(false);
//	freopen("out.txt","w",stdout);
	ll t;
	cin >> t;
	while (t --) {
		ll n, m;
		cin >> n >> m;
		map<ll, map<char, ll> > mp;
		for (ll i = 0; i < n; i ++) { // 读入原始字符串 
			string s;
			cin >> s; 
			for (ll j = 0; j < m; j ++)  mp[j][s[j]] ++; // 统计每一列的字符个数 
		}
		for (ll i = 0; i < n - 1; i ++) { // 读入修改后的字符串 
			string s;
			cin >> s;
			for (ll j = 0; j < m; j ++)  mp[j][s[j]] --; // 将修改后的字符串每一列的所有字符从map删除 
		}
		for (ll i = 0; i < m; i ++) {
			vector<PAIR> vt(mp[i].begin(), mp[i].end()); // 转换成vector按照字母个数排序 
			sort(vt.begin(), vt.end(), cmp);
			cout << vt[0].first; // 数量最多的一定是只剩下1个的字母，输出 
		}
		cout << '\n';
	}
	return 0;
}