2017 Multi-University Training Contest - Team 2 1001 && HDU6045
2017-07-27 19:44
465 查看
Is Derek lying?
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 177 Accepted Submission(s): 107
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
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 177 Accepted Submission(s): 107
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
#include <bits/stdc++.h> using namespace std; char str1[80001]; char str2[80001]; int main(){ int T; scanf("%d",&T); while(T--){ int n,x,y,k,g; cin>>n>>k>>g; scanf("%s",str1); scanf("%s",str2); x=0; for(int i=0;i<n;i++){ if(str1[i]==str2[i]) x++; } y=n-x; if(k>=x){ if(k>=y){ if(g>=k-y&&g<=y-k+2*x){ puts("Not lying"); } else { puts("Lying"); } } else { if(g>=0&&g<=y-k+2*x){ puts("Not lying"); } else { puts("Lying"); } } } else { if(k>=y){ if(g>=k-y&&g<=k+y){ puts("Not lying"); } else { puts("Lying"); } } else { if(g>=0&&g<=k+y){ puts("Not lying"); } else { puts("Lying"); } } } } return 0; }
相关文章推荐
- 2017 Multi-University Training Contest - Team 1 1001&&HDU 6033 Add More Zero【签到题,数学,水】
- 2017 Multi-University Training Contest - Team 2:1001&hdu6045、 Is Derek lying?
- 2017 Multi-University Training Contest - Team 9 1001&&HDU 6161 Big binary tree【树形dp+hash】
- 2017 Multi-University Training Contest - Team 1 1001 Add More Zero
- 2017 Multi-University Training Contest - Team 1 1003&&HDU 6035 Colorful Tree【树形dp】
- HDU6043 & 2017 Multi-University Training Contest - Team 1
- 2017 Multi-University Training Contest - Team 1 1002&&HDU 6034 Balala Power!【字符串,贪心+排序】
- 2017 Multi-University Training Contest - Team 5:1006&hdu6090、 Rikka with Graph
- 2017 Multi-University Training Contest - Team 6:1008&hdu6103、Kirinriki
- 2017 Multi-University Training Contest - Team 4:1009&hdu6075、Questionnaire
- 2017 Multi-University Training Contest - Team 2 1001 Is Derek lying?
- 2017 Multi-University Training Contest - Team 5:1011&hdu6095、Rikka with Competition
- 2017 Multi-University Training Contest - Team 2 1001 1 Is Derek lying?
- 2017 Multi-University Training Contest - Team 3:1011&hdu6066、RXD's date
- 2017 Multi-University Training Contest - Team 4:1011&hdu6077、Time To Get Up
- 2017 Multi-University Training Contest - Team 2 1001 Is Derek lying?
- 2017 Multi-University Training Contest - Team 2:1011&hdu6095、Regular polygon
- 2017 Multi-University Training Contest - Team 2:1003&hdu6047、Maximum Sequence
- 2017 Multi-University Training Contest - Team 2 && HDU6047
- 2017 Multi-University Training Contest - Team 1 1001 Add More Zero