CFrou685 C. String Equality【思维】

Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.

He wants to convert string a
into string b by performing some (possibly zero) operations on a.
In one move, he can either choose an index i

(1≤i≤n−1) and swap ai and ai+1, orchoose an index i(1≤i≤n−k+1) and if ai,ai+1,…,ai+k−1 are all equal to some character c (c≠ ‘z’), replace each one with the next character (c+1) , that is, ‘a’ is replaced by ‘b’, ‘b’ is replaced by ‘c’ and so on.

Note that he can perform any number of operations, and the operations can only be performed on string a.

Help Ashish determine if it is possible to convert string a
into b

after performing some (possibly zero) operations on it.
Input

The first line contains a single integer t
(1≤t≤105) — the number of test cases. The description of each test case is as follows.

The first line of each test case contains two integers n
(2≤n≤106) and k (1≤k≤n).

The second line of each test case contains the string a
of length n consisting of lowercase English letters.

The third line of each test case contains the string b
of length n consisting of lowercase English letters.

It is guaranteed that the sum of values n
among all test cases does not exceed 106.
Output

For each test case, print “Yes” if Ashish can convert a
into b

after some moves, else print “No”.

You may print the letters of the answer in any case (upper or lower).
Example
Input
Copy

4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc

Output
Copy

No
Yes
No
Yes

Note

In the first test case it can be shown that it is impossible to convert a
into b

.

In the second test case,

“abba” −→inc
“acca” −→inc … −→inc

“azza”.

Here “swap” denotes an operation of the first type, and “inc” denotes an operation of the second type.

In the fourth test case,

“aaabba” −→−−swap
“aaabab” −→−−swap “aaaabb” −→inc … −→inc “ddaabb” −→inc … −→inc “ddddbb” −→inc … −→inc “ddddcc”.
题意：
判断字符串a是否能变成b。
思路：
先删去重复的元素，然后遍历a - z，先判断a和b是否都有这个元素，若有就删去，若a有b无就判断是否能让该元素+1.

#include <iostream>
#include <algorithm>
#include <cstring> 
using namespace std;

string solve() {
	int n, k;
	cin >> n >> k; 
	string a, b;
	cin >> a >> b;
	int ta[300] = {0};
	int tb[300] = {0};
	for(int i = 0;i < a.size();i ++)	ta[a[i]]++;
	for(int i = 0; i < b.size(); i++)	tb[b[i]]++;
	for(int i = 'a'; i <= 'z'; i++) {
		int x = min(ta[i], tb[i]);
		ta[i] -= x;
		tb[i] -= x;
	}
	for(int i = 'a'; i < 'z'; i++) {
		if(ta[i] && tb[i]) {
			int x = min(ta[i], tb[i]);
			ta[i] -=  x;
			tb[i] -= x;
		}
		if(ta[i] && tb[i] == 0) {
			if(ta[i] % k == 0)
				ta[i + 1] += ta[i], ta[i] = 0;
			else
				return "No";
		}
	}
	for(int i = 'a'; i <= 'z';i ++) {
		if(ta[i] != tb[i])
			return "No";
	}
	return "Yes";
}

int main() {
	int t;
	cin >> t;
	while(t--)
		cout << solve() << endl;
	return 0;
}