Derek
Derek and
Alfia
Alfia are good friends.
Derek
Derek is Chinese,and
Alfia
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
N choice questions and each question is followed by three choices marked “
A
A” “
B
B” and “
C
C”.Each question has only one correct answer and each question is worth
1
1 point.It means that if your answer for this question is right,you can get
1
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
Derek the total score of him and
Alfia
Alfia.Then
Alfia
Alfia will ask
Derek
Derekthe total score of her and he will tell her: “My total score is
X
X,your total score is
Y
Y.”But
Derek
Derek is naughty,sometimes he may lie to her. Here give you the answer that
Derek
Derek and
Alfia
Alfia made,you should judge whether
Derek
Derek is lying.If there exists a set of standard answer satisfy the total score that
Derek
Derek said,you can consider he is not lying,otherwise he is lying.
For each test case,there will be three lines.
The first line consists of three integers N N, X X, Y Y,the meaning is mentioned above.
The second line consists of N N characters,each character is “ A A” “ B B” or “ C C”,which represents the answer of Derek Derek for each question.
The third line consists of N N characters,the same form as the second line,which represents the answer of Alfia Alfia for each question.
Data Range: 1≤N≤80000 1≤N≤80000, 0≤X,Y≤N, 0≤X,Y≤N, ∑Ti=1N≤300000 ∑i=1TN≤300000
Please print “ Lying Lying” if you can make sure that Derek Derek is lying,otherwise please print “ Not lying Not lying”.
2 3 1 3 AAA ABC 5 5 0 ABCBC ACBCB
Not lyingLying
1.fabs(x-y)<=cnt;//两者答对题目之差要小于等于不相同的答案数,取等的条件是对于不相同的答案 都是同一人答对
2.x+y<=2*n-cnt//两者答对题目之和要小于等于 题目总数的两倍减去不相同的答案,取等的条件是两人相同答案的题 全对
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; char aa[100000],bb[100000]; int main() { int t,i,j,k,a,n,m,b; scanf("%d",&t); while(t--) { int num=0; scanf("%d %d %d",&n,&a,&b); getchar(); gets(aa); gets(bb); for(i=0; i<n; i++) { if(aa[i]!=bb[i]) num++; } //printf("%d %d\n",a+b,2*n-num); if(a+b<=2*n-num&&abs(a-b)<=num) { printf("Not lying\n"); } else { printf("Lying\n"); } } return 0; }