hdu 6045 Is Derek lying?

题目链接：传送门

Is Derek lying?

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1606 Accepted Submission(s): 830

Problem Description
Derek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer camp,there will be fan tests at intervals.The test consists of N choice questions and each question is followed by three choices marked “A” “B” and “C”.Each question has only one correct answer and each question is worth 1 point.It means that if your answer for this question is right,you can get 1 point.The total score of a person is the sum of marks for all questions.When the test is over,the computer will tell Derek the total score of him and Alfia.Then Alfia will ask Derek the total score of her and he will tell her: “My total score is X,your total score is Y.”But Derek is naughty,sometimes he may lie to her. Here give you the answer that Derek and Alfia made,you should judge whether Derek is lying.If there exists a set of standard answer satisfy the total score that Derek said,you can consider he is not lying,otherwise he is lying.

Input
The first line consists of an integer T,represents the number of test cases.

For each test case,there will be three lines.

The first line consists of three integers N,X,Y,the meaning is mentioned above.

The second line consists of N characters,each character is “A” “B” or “C”,which represents the answer of Derek for each question.

The third line consists of N characters,the same form as the second line,which represents the answer of Alfia for each question.

Data Range:1≤N≤80000,0≤X,Y≤N,∑Ti=1N≤300000

Output
For each test case,the output will be only a line.

Please print “Lying” if you can make sure that Derek is lying,otherwise please print “Not lying”.

Sample Input
2
3 1 3
AAA
ABC
5 5 0
ABCBC
ACBCB

Sample Output
Not lying
Lying

哎，好惨啊，感觉只会做水题了，完全比不过人家orz。

题目大意：一份试卷有n道题，一个人说我得了x,一个人说我得了y，下面两行是他们的答案，x(代表一个人）问y的分数，问y有没有可能说谎。

思路：按照x的得分和两人的答案，算出y得分的范围，只要在范围内，就没有说慌，否则，说谎。

#include<stdio.h>
#include<math.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
char a[800009],b[800009];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int n,x,y;
        scanf("%d%d%d",&n,&x,&y);
        scanf("%s%s",a,b);
        int sum=0;
        for(int i=0; i<n; i++)
            if(a[i]==b[i])//有几个是相同的答案
                sum++;
        if((sum>=x&&y<=(x+n-sum)&&y>=x-(n-sum))||(sum<x&&y>=(sum+x-n)&&y<=(n-x+sum)))//y的范围
            printf("Not lying\n");
        else printf("Lying\n");
    }
    return 0;
}