hdu 多校联赛 Is Derek lying?-优快云博客

本文链接：https://blog.youkuaiyun.com/wumingkeqi/article/details/76275475

本文介绍了一个简单的算法，用于判断在一次包含多项选择题的比赛中，一名参赛者关于自己及另一位参赛者的得分陈述是否可能真实。通过比较两者的答案并结合所声称的得分，算法能够快速确定陈述的真实性。

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

Is Derek lying?

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

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

这道题是第二场比赛最不需要什么高深算法的一道题也是ac最多的题可以说是最简单的一道题几乎所有的队伍都做出来了感觉这道题主要考察了思维在草纸上演算盐酸的话ac只是时间问题

题意：一个比赛n道题 Derek和 Alfia 两个人去比赛有n道题每道题有三个选项只有一个是正确答案 derek知道了成绩可是他可能会撒谎给你derek所说的成绩和两个人的所选选项判断他是否撒谎

ac代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    int n,a1,b1;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            int num=0,el=0;
            scanf("%d%d%d",&n,&a1,&b1);//数据输入
            char a[n+5],b[n+5];
            scanf("%s",&a);
            scanf("%s",&b);
            for(int i=0;i<n;i++)//对比两个人的选项有多少个相同的
                {
                    if(a[i]==b[i])
                    {
                        num++;
                    }
                }
                el=n-num;//n减去相同的就指导不同的个数
                int min=num;//定义一个最小值 让其等于 相同的选项个数，derek正确的个数，alfia正确的个数中的最小值
                if(min>=a1)
                    min=a1;
                if(min>=b1)
                    min=b1;
                a1=a1-min;//derek得分减去这个最小值
                b1=b1-min;//alfia得分减去这个最小值
                if(a1+b1>el)//如果两个人分数减去最小值之后的和大于不同选项的个数 则可判断为撒谎
                {
                    printf("Lying\n");
                }
                else if(a1+b1<=el)//反之 则没撒谎
                {
                    printf("Not lying\n");
                }
        }
    }
    return 0;
}

、