hdu6045

Is Derek lying?

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 626    Accepted Submission(s): 359

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 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 Dereksaid,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

23 1 3AAAABC5 5 0ABCBCACBCB

 

Sample Output

Not lyingLying
思路：这题其实只要判断相同的字母数是否在两人对的题目和减去总题数和总题数减去来两人对的差的绝对值之间，如果在就输出“Not lying”。
代码：
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <cmath>#include <stdlib.h>#include <vector>#include <queue>#include <stack>using namespace std;const int MOD=1e9+7;vector<int>a1;vector<int>a2;int v[100005];int main(){    int T;    cin>>T;    while(T--)    {        int N,x,y;        scanf("%d %d %d",&N,&x,&y);        int c=x+y-N;        int d=N-abs(x-y);        char a[80005],b[80005];        int i;        scanf("%s%s",a,b);        int k=0;        for(i=0;i<N;i++)        {            if(a[i]==b[i])            {                k++;            }        }        if(k<=d&&k>=c)        {            cout<<"Not lying"<<endl;        }        else cout<<"Lying"<<endl;    }    return 0;}