题目传送：http://acm.hdu.edu.cn/showproblem.php?pid=6045
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 687 Accepted Submission(s): 389
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 1point.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 Alfiawill 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
启发博客：http://www.cnblogs.com/liuzhanshan/p/7249358.html
考虑到只有两种情况下这是不正确的：
1.x+y超过了给定答案能够提供的最大分数，这是x+y的上界。注意，x+y是没有下界的（可以答对0道）
2.x与y的差值过大。例如，答案全为相同的，x与y的差值为1。处理这种情况时，找到差值的上界（差值只能从不相同的答案得到），比较即可。
x+y>2*n-cnt
abs(x-y)>cnt
1 #include<cstdio>
2 #include<iostream>
3 #include<cmath>
4 using namespace std;
5
6 int main()
7 {
8 int T;
9 int n,y,x,cnt;
10 char a[80000+5];
11 char b[80000+5];
12 scanf("%d",&T);
13 while(T--)
14 {
15 cin>>n>>y>>x;
16 cin>>a>>b;
17 cnt=0;
18 for(int i=0;i<n;i++)
19 if(a[i]!=b[i])
20 cnt++;
21 if(abs(y-x)>cnt)
22 printf("Lying\n");
23 else if(x+y>2*n-cnt)
24 printf("Lying\n");
25 else
26 printf("Not lying\n");
27 }
28 return 0;
29 }