Derek lying?
来源:互联网 发布:小爱和花儿知乎 编辑:程序博客网 时间:2024/06/14 07:40
Is Derek lying?
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 Alfiawill 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.
输入
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
输出
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”.
样例输入
23 1 3AAAABC5 5 0ABCBCACBCB
样例输出
Not lyingLying
代码
#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++; else l++; } if (s >= x + y - n && l >= abs(x - y)) { printf("Not lying\n"); } else printf("Lying\n"); }}
- Derek lying?
- Is Derek lying?
- Is Derek lying?
- 1001.Is Derek lying?
- hdu6045 Is Derek lying
- HDU6045-Is Derek lying?
- Is Derek lying?
- HDU6045-Is Derek lying?
- Is Derek lying?
- Is Derek lying?
- hdu6045 Is Derek lying?
- Is Derek lying?
- Is Derek lying?
- Is Derek lying?
- Is Derek lying?
- Is Derek lying? HDU
- HDOJ 6045-Is Derek lying?
- hdu 6054-Is Derek lying?
- hdu6035-树形dp-2017多校(2)&难-Colorful Tree
- 织梦DedeCms调用整站相关文章不限栏目的方法
- 两周的学习感触
- html心得
- PagerAdapter闪屏坑的修复
- Derek lying?
- jquery.twbsPagination.js动态页码分页demo
- CNTK API文档翻译(12)——CNTK进阶
- Quicksum
- CF758D---Ability To Convert(模拟+贪心思想(仅仅是思想))
- HTML:利用border写出三角形的三种方法
- C++进阶 降低文件间的编译依存关系(接口与实现解耦合)
- 【iOS】简单易用的折线图控件
- Gradle plugin自定义