HDU6045+Is Derek lying?（思路）+多校联赛第二场-优快云博客

本文介绍了一道算法题目，需要判断德瑞克在一场选择题考试中是否对其朋友阿尔菲亚说了谎。通过对比两人的答案并结合给出的分数，来确定德瑞克的回答是否真实。

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

Is Derek lying?

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

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

  
   2
3 1 3
AAA
ABC
5 5 0
ABCBC
ACBCB

Sample Output

  
   Not lying
Lying

Source

2017 Multi-University Training Contest - Team 2

Recommend

liuyiding | We have carefully selected several similar problems for you: 6055 6054 6053 6052 6051

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
char a[100010];
char b[100010];
int main()
{
    int t,n,m,x,y,sum;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&x,&y);
        sum=0;
        scanf("%s",a);
        scanf("%s",b);
        for(int i=0; i<n; i++)
        {
            if(a[i]==b[i])
                sum++;
        }
        if(x<y)
        {
            m=x;
            x=y;
            y=m;
        }
         if((x+y-sum<=n)&&(x-y+sum<=n))
            printf("Not lying\n");
        else
            printf("Lying\n");
    }
}