ZOJ 3959 Problem Preparation 【】
来源:互联网 发布:网络布线 报价 编辑:程序博客网 时间:2024/06/06 10:46
It's time to prepare the problems for the 14th Zhejiang Provincial Collegiate Programming Contest! Almost all members of Zhejiang University programming contest problem setter team brainstorm and code day and night to catch the deadline, and empty bottles of Marjar Cola litter the floor almost everywhere!
To make matters worse, one of the team member fell ill just before the deadline. So you, a brilliant student, are found by the team leader Dai to help the team check the problems' arrangement.
Now you are given the difficulty score of all problems. Dai introduces you the rules of the arrangement:
- The number of problems should lie between 10 and 13 (both inclusive).
- The difficulty scores of the easiest problems (that is to say, the problems with the smallest difficulty scores) should be equal to 1.
- At least two problems should have their difficulty scores equal to 1.
- After sorting the problems by their difficulty scores in ascending order, the absolute value of the difference of the difficulty scores between two neighboring problems should be no larger than 2. BUT, if one of the two neighboring problems is the hardest problem, there is no limitation about the difference of the difficulty scores between them. The hardest problem is the problem with the largest difficulty score. It's guaranteed that there is exactly one hardest problem.
The team members have given you lots of possible arrangements. Please check whether these arrangements obey the rules or not.
Input
There are multiple test cases. The first line of the input is an integer T (1 ≤ T ≤ 104), indicating the number of test cases. Then T test cases follow.
The first line of each test case contains one integer n (1 ≤ n ≤ 100), indicating the number of problems.
The next line contains n integers s1, s2, ... , sn (-1000 ≤ si ≤ 1000), indicating the difficulty score of each problem.
We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.
Output
For each test case, output "Yes" (without the quotes) if the arrangement follows the rules, otherwise output "No" (without the quotes).
Sample Input
891 2 3 4 5 6 7 8 9101 2 3 4 5 6 7 8 9 1011999 1 1 2 3 4 5 6 7 8 911999 1 3 5 7 9 11 13 17 19 211015 1 13 17 1 7 9 5 3 11131 1 1 1 1 1 1 1 1 1 1 1 2102 3 4 5 6 7 8 9 10 111015 1 13 3 6 5 4 7 1 14
Sample Output
NoNoYesNoYesYesNoNo
Hint
The first arrangement has 9 problems only, which violates the first rule.
Only one problem in the second and the fourth arrangement has a difficulty score of 1, which violates the third rule.
The easiest problem in the seventh arrangement is a problem with a difficulty score of 2, which violates the second rule.
After sorting the problems of the eighth arrangement by their difficulty scores in ascending order, we can get the sequence 1, 1, 3, 4, 5, 6, 7, 13, 14, 15. We can easily discover that |13 - 7| = 6 > 2. As the problem with a difficulty score of 13 is not the hardest problem (the hardest problem in this arrangement is the problem with a difficulty score of 15), it violates the fourth rule.
#include <iostream>#include<cstdio>#include<cmath>#include<string>#include<cstring>#include<queue>#include<stack>#include<algorithm>using namespace std;int i,j,k,b,n,m;int a[100+10];int main(){ int T; int sum1,sum2; scanf("%d",&T); while(T--){ scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); if(a[0]==1&&a[1]==1&&(n>=10&&n<=13)){ int flag=0; for(int j=2;j<n-1;j++){ if(a[j]-a[j-1]>2){ flag=1;break; } } if(flag)printf("No\n"); else printf("Yes\n"); } else printf("No\n"); } return 0;}
- ZOJ 3959 Problem Preparation
- ZOJ 3959 Problem Preparation 【】
- zoj 3959 Problem Preparation
- ZOJ 3959Problem Preparation
- Problem Preparation
- Problem Preparation
- Problem Preparation
- Problem Preparation T
- ZOJ3959-Problem Preparation
- Preparation
- Problem Preparation for HTML to TXT
- ZOJ Problem 1374 Substrings
- ZOJ Problem Set - 2060
- ZOJ Problem Set - 2972
- ZOJ Problem Set - 1037
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 1049
- ZOJ Problem Set - 1051
- 带有注解的servlet的生命周期.
- css绝对定位
- 2017.4.26 组合数问题 思考记录
- python3 分支界限法解决作业分配问题
- java创建对象的5种方式
- ZOJ 3959 Problem Preparation 【】
- 时钟
- 移动端UI自动化Appium测试——DesiredCapabilities参数配置及含义
- OCLint 安装与使用
- Linux学习笔记之浅谈init命令
- Python基础数据结构之dict
- fusionChart 中 总是遇到 loading chart. please wait.
- 大白 计算几何专题 凸包、半平面交、平面区域 部分例题练习题总结
- Hive 用ROW_NUMBER取每组top n