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

来源:互联网 发布:c语言实现五子棋 编辑:程序博客网 时间:2024/06/01 08:46
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:1N800001≤N≤80000,0X,YN,0≤X,Y≤N,Ti=1N300000∑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
23 1 3AAAABC5 5 0ABCBCACBCB
Sample Output
Not lyingLying
#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");elseprintf("Lying\n");}}}


原创粉丝点击