HDU 6045多校Is Derek lying?

大致就是随便判一判
三种情况分类讨论一下就能过

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define mem(i,a) memset(i,a,sizeof(i))
#define rson mid+1,r,rt<<1|1
#define lson l,mid,rt<<1

#define mp make_pair
#define pb push_back
#define ll long long
#define LL long long
using namespace std;
template <typename T>inline void read(T &_x_){
    _x_=0;bool f=false;char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch=='-') f=!f;ch=getchar();}
    while ('0'<=ch&&ch<='9') {_x_=_x_*10+ch-'0';ch=getchar();}
    if(f) _x_=-_x_;
}
const double eps = 1e-8;
const int maxn = 3e5+7;
const int mod = 1e9+7;
const ll inf = 1e15;

int n,t,x,y;
char s[maxn],c[maxn];

int main(){
    read(t);
    while(t--){
        scanf("%d%d%d",&n,&x,&y);
        scanf("%s",s);
        scanf("%s",c);
        int cnt=0;
        for(int i=0;i<n;i++){
            if(s[i]==c[i]) cnt++;
        }
        int md=min(x,y);
        int mdzz = max(x,y);
        if(n-mdzz>=cnt-md&&mdzz>=cnt&&md<=cnt){
            printf("Not lying\n");
            continue;
        }
        if(n-cnt>=mdzz-md&&mdzz<=cnt&&md<=cnt){
            printf("Not lying\n");
            continue;
        }
        if(n-mdzz>=md-cnt&&mdzz>=cnt&&md>=cnt){
            printf("Not lying\n");
            continue;
        }
        printf("Lying\n");
    }
    return 0;
}