Is Derek lying?-2017 暑期组队训练赛1-HDU-

最新推荐文章于 2019-07-03 20:38:30 发布

原创最新推荐文章于 2019-07-03 20:38:30 发布 · 342 阅读

0 ·

CC 4.0 BY-SA版权

数学专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一个有趣的数学问题：通过比较两个朋友在多项选择题中的得分来判断一人是否撒谎。文章提供了输入输出示例及解决算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

DerekDerek and AlfiaAlfia are good friends.DerekDerek is Chinese,and AlfiaAlfia 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 NN choice questions and each question is followed by three choices marked “AA” “BB” and “CC”.Each question has only one correct answer and each question is worth 11point.It means that if your answer for this question is right,you can get 11point.The total score of a person is the sum of marks for all questions.When the test is over,the computer will tell DerekDerek the total score of him and AlfiaAlfia.Then AlfiaAlfia will ask DerekDerek the total score of her and he will tell her: “My total score is XX,your total score is YY.”But DerekDerek is naughty,sometimes he may lie to her. Here give you the answer that DerekDerek and AlfiaAlfia made,you should judge whether DerekDerekis lying.If there exists a set of standard answer satisfy the total score that DerekDerek said,you can consider he is not lying,otherwise he is lying.

Input

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

For each test case,there will be three lines.

The first line consists of three integers NN,XX,YY,the meaning is mentioned above.

The second line consists of NN characters,each character is “AA” “BB” or “CC”,which represents the answer of DerekDerek for each question.

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

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

Output

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

Please print “LyingLying” if you can make sure that DerekDerek is lying,otherwise please print “Not lyingNot lying”.

Sample Input

2
3 1 3
AAA
ABC
5 5 0
ABCBC
ACBCB

Sample Output

Not lying
Lying

#include<stdio.h>
#include<string>
#include<iostream>//暴力吧数学问题
#include<algorithm>
using namespace std;
int main()
{
	int i,sum,t,n,x,y,k1;
	while(~scanf("%d",&t))
	{
		while(t--)
		{
			sum=0;
			string s1,s2;
			scanf("%d%d%d",&n,&x,&y);
			cin>>s1;
			cin>>s2;
			for(i=0;i<n;i++)
			{
				if(s1[i]==s2[i])
				sum++;
			}
			k1=min(sum,x);//k1表示共同对的题目数量，k2表示第一个人作对的题（不是共同作对的）
			int flag=0,k2;
			for(i=k1;i>=0;i--)//枚举k1 
			{
				k2=x-i;
				if(n-sum-k2>=0)//保证答案不同的题目中第二个人可能作对的题目大于0
				{
					if(y>=i&&(i+n-sum-k2)>=y)//y要大于共同作对的题目数，同时共同做对的题目数加上第二个人可能作对的题目要大于y 
					{
						flag=1;
						break;
					}
				}
			}
			if(flag)
			printf("Not lying\n");
			else
			printf("Lying\n");
		}
	}
}