hdu6045 Is Derek lying?

Is Derek lying?

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1162    Accepted Submission(s): 629

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
   
   

 

题目意思是Derek和Alfia共同做了n道选择题，给出两人的答案和得分，问是否存在满足这种得分的情况

解题思路：两人的回答只有两种，一种回答相同，一种不同；相同的回答要么都对(记为a)，要么都错(记为b)，不同的回答，要么都错，要么一个对一个错；然后很容易得出约束条件|x-y|<b；x+y<a*2+b;因此只要记录两种回答的个数a，b判断是否满足条件就行了

代码如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
	std::ios::sync_with_stdio(false);
	int T,n,x,y;
	int a,b,i;
	string s1,s2;
	cin>>T;
	while(T--)
	{
		cin>>n>>x>>y;
		cin>>s1;
		cin>>s2;
		a=0;
		b=0;
		for(i=0;i<n;i++)
		{
			if(s1[i]==s2[i])
				a++;
			else
				b++;
		}
		if(abs(x-y)<=b&&(x+y)<=2*a+b)
			cout<<"Not lying"<<endl;
		else
			cout<<"Lying"<<endl;
	}
	return 0;
}