Hdu6045 Is Derek lying?(2017多校第2场)

本文介绍了一个算法问题,通过分析两人在选择题测试中给出的答案及其得分情况,来判断一个人是否可能在告诉对方成绩时撒谎。该算法考虑了正确答案可能导致的不同得分组合。

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

Is Derek lying?

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


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:1N80000,0X,YN,Ti=1N300000
 

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

—————————————————————————————————

题目的意思是给出n个问题两个人的答案和总分,问题答对得一分答错不得分,问有没有可能

思路:找到两个人答案相同的个数,然后不同数量肯定大于等于分数之差,小于等于各自的分数减去相同答案之和

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <string>  
#include <algorithm>  
#include <map>  
#include <cmath>  
#include <set>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <bitset>  
#include <functional>

using namespace std;

#define LL long long  
const int INF = 0x3f3f3f3f;

char s1[100005], s2[100005];
int main()
{
    int a, b, n, t;

    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d%d", &n, &a, &b);
        if (a < b)
            swap(a, b);
        scanf("%s", s1);
        scanf("%s", s2);
        int cnt = 0;
        for (int i = 0; i < n; i++)
            if (s1[i] == s2[i]) cnt++;
        if (n - cnt >= a - b&&a + b - 2 * cnt <= n - cnt) printf("Not lying\n");
        else printf("Lying\n");
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值