2017 Multi-University Training Contest - Team 2 1001 Is Derek lying?

題目鏈接：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;
}