17暑假多校联赛2.1 HDU 6045 Is Derek lying?

Is Derek lying?

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

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

23 1 3AAAABC5 5 0ABCBCACBCB

Sample Output

Not lyingLying

 
题目网址：http://acm.hdu.edu.cn/showproblem.php?pid=6045
 

分析

题意：有N道选择题，每道题只有”A”,”B”,”C”三个选项，每道题1分，Derek和Alfia两人中只有Derek知道两个人的分数，Derek告诉Alfia：“我得了X分Alfia，你得了Y分”，给出Derek和Alfia的所有题的选项，判断Derek是否说谎了
很简单的一道题，记录下两人答案相同的题目数量和答案不同的题目数量，两人的总分之和不能大于相同题目数+总题目数（相同题目数+总体数，相当于一个人做全对，此时总分之和最大，所以两人总分之和不会超过相同题目数+总题目数），两个人的分数的差值不会大于不同题目数（一个人全对，此时分数差值最大，切等于不同题目数，所以分数的差值不会大于不同题目数）
 

代码

#include<cstdio>#include<algorithm>#include<string.h>#include <iostream>#include <math.h>using namespace std;char a[800005],b[800005];int main(){    int t;    scanf("%d",&t);    while(t--)    {        int n ,x,y,s,l;        s=0;l=0;        scanf("%d %d %d",&n,&x,&y);        scanf("%s",a);        scanf("%s",b);        for(int i=0;i<n;i++)        {            if(a[i]==b[i])                s++;///两人答案相同则s++            else l++;///答案不同则l++        }        if (s>=x+y-n&&l>=abs(x-y))///判断是否满足分析中所阐述的情况        {            printf("Not lying\n");        }        else printf("Lying\n");    }}