题目链接:Is Derek lying?
题解:x和y的最大值maxx、最小值minn以及两个字符串比较不相同的字符数目diff之间比较分情况讨论。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<iostream>
typedef long long ll;
using namespace std;
const int maxn = 8e4+10;
char str1[maxn];
char str2[maxn];
int main(){
ios::sync_with_stdio(false);
int T;
int n,x,y,diff;
cin >> T;
while(T--){
diff = 0;
cin >> n >> x >> y;
cin >> str1;
cin >> str2;
int maxx = max(x,y);
int minn = min(x,y);
for(int i = 0; i < n; i++){
if(str1[i] != str2[i]) diff++;
}
if(diff == 0){
if(x != y){
puts("Lying");
}else{
puts("Not lying");
}
}else if(diff > 0 && diff < n){
if(maxx >= diff){
if(minn >= (maxx - diff) && minn <= (2*n - maxx - diff)){
puts("Not lying");
}else{
puts("Lying");
}
}else{
if(minn <= (2*n - diff - maxx) && minn >= 0){
puts("Not lying");
}else{
puts("Lying");
}
}
}else if(diff == n){
if(minn <= (n - maxx) && minn >= 0){
puts("Not lying");
}else{
puts("Lying");
}
}
}
return 0;
}