传送门
分析
我是真的不会写构造啊55555
首先如果可以的话,填a显然是最优情况,剩下就要考虑调整那些位置可以保证汉明距离相等
首先如果相同的位置,直接填a就可以了,那么不同的位置,就要考虑如果这一位填的字母造成的距离影响能不能用后面的距离去抵消,所以我们要从后往前维护一个不相同字符前缀,然后循环每一种字母情况即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char a[N],b[N];
int f[N];
int n,res;
bool check(char x,int i){
int p = res;
if(a[i] != x) p++;
if(b[i] != x) p--;
return abs(p) <= f[i + 1];
}
int main() {
int T;
int idx = 0;
read(T);
while(T--){
scanf("%s %s",a + 1,b + 1);
printf("Case %d: ",++idx);
n = strlen(a+ 1);
f[n + 1] = 0;
for(int i = n;i;i--) {
f[i] = f[i + 1];
if(a[i] != b[i]) f[i]++;
}
res = 0;
for(int i = 1;i <= n;i++){
for(char j = 'a';j <= 'z';j++){
if(!check(j,i)) continue;
cout << j;
if(a[i] != j) res++;
if(b[i] != j) res--;
break;
}
}
puts("");
}
return 0;
}