Codeforces Round #278 (Div. 2)B—— Candy Boxes
来源:互联网 发布:淘宝商品详情页模板 编辑:程序博客网 时间:2024/05/20 03:46
There is an old tradition of keeping 4 boxes of candies in the house in Cyberland. The numbers of candies arespecial if their arithmetic mean, their median and theirrange are all equal. By definition, for a set{x1, x2, x3, x4} (x1 ≤ x2 ≤ x3 ≤ x4)arithmetic mean is ,median is andrange is x4 - x1.The arithmetic mean and median are not necessary integer. It is well-known that if those three numbers are same, boxes will create a "debugging field" and codes in the field will have no bugs.
For example, 1, 1, 3, 3 is the example of 4 numbers meeting the condition because their mean, median and range are all equal to2.
Jeff has 4 special boxes of candies. However, something bad has happened! Some of the boxes could have been lost and now there are onlyn (0 ≤ n ≤ 4) boxes remaining. Thei-th remaining box contains ai candies.
Now Jeff wants to know: is there a possible way to find the number of candies of the4 - n missing boxes, meeting the condition above (the mean, median and range are equal)?
The first line of input contains an only integer n (0 ≤ n ≤ 4).
The next n lines contain integers ai, denoting the number of candies in thei-th box (1 ≤ ai ≤ 500).
In the first output line, print "YES" if a solution exists, or print "NO" if there is no solution.
If a solution exists, you should output 4 - n more lines, each line containing an integerb, denoting the number of candies in a missing box.
All your numbers b must satisfy inequality1 ≤ b ≤ 106. It is guaranteed that if there exists a positive integer solution, you can always find suchb's meeting the condition. If there are multiple answers, you are allowed to print any of them.
Given numbers ai may follow in any order in the input, not necessary in non-decreasing.
ai may have stood at any positions in the original set, not necessary on lowestn first positions.
211
YES33
3111
NO
41223
YES
很麻烦的一题啊,需要分别考虑0,1,2,3,4个数的情况
#include <map>#include <set>#include <list>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int a[5];int main(){int n;while (~scanf("%d", &n)){for (int i = 1; i <= n; ++i){scanf("%d", &a[i]);}sort(a + 1, a + n + 1);if (n == 4){double u = (a[1] + a[2] + a[3] + a[4]) * 1.0;u /= 4;double v = (a[4] - a[1]);double w = (a[2] + a[3]) * 1.0 / 2;if (u != v || u != w || v != w){printf("NO\n");}else{printf("YES\n");}continue;}else if(n == 3){int u = (a[2] + a[3] - a[1]);bool flag = false;bool flag2 = false;bool flag3 = false;bool flag4 = false;int p = u + a[1] + a[2] + a[3];int q = u - a[1];int r = a[2] + a[3];if (p % 4 || r % 2){flag = true;}else{p /= 4;r /= 2;}if (!flag && (p != q || p != r || q != r)){flag = true;}if (!flag && u >= 1 && u <= 1000000 && u >= a[3]){printf("YES\n");printf("%d\n", u);continue;}u = a[1] + a[2] - a[3];p = u + a[1] + a[2] + a[3];q = a[3] - a[1];r = (u + a[2]);if (p % 4 || r % 2){flag2 = true;}else{p /= 4;r /= 2;}if (!flag2 && (p != q || p != r || q != r)){flag2 = true;}if (!flag2 && u >= 1 && u <= 1000000 && u >= a[2] && u <= a[3]){printf("YES\n");printf("%d\n", u);continue;}u = a[1] + a[3] - a[2];p = u + a[1] + a[2] + a[3];q = a[3] - a[1];r = (u + a[2]);if (p % 4 || r % 2){flag3 = true;}else{p /= 4;r /= 2;}if (!flag3 && (p != q || p != r || q != r)){flag3 = true;}if (!flag3 && u >= 1 && u <= 1000000 && u >= a[1] && u <= a[2]){printf("YES\n");printf("%d\n", u);continue;}u = a[1] + a[2] - a[3]; p = u + a[1] + a[2] + a[3];q = a[3] - u;r = a[1] + a[2];if (p % 4 || r % 2){flag4 = true;}else{p /= 4;r /= 2;}if (!flag4 && (p != q || p != r || q != r)){flag4 = true;}if (!flag4 && u >= 1 && u <= 1000000 && u <= a[1]){printf("YES\n");printf("%d\n", u);continue;}if (flag && flag2 &&flag3 && flag4){printf("NO\n");}}else if(n == 1){int x4 = 3 * a[1];int x23 = x4 + a[1];int x2, x3;x2 = x3 = x23 / 2;if (a[1] <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n%d\n", x2, x3, x4);}else{printf("NO\n");}}else if ( n == 2){int x1 = a[1], x2 = a[2];int x4 = 3 * a[1];int x3 = 4 * x1 - x2;if (x1 <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n", x3, x4);continue;}x1 = a[1];x3 = a[2];x4 = 3 * a[1];x2 = 4 * x1 - x3;if (x1 <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n", x2, x4);continue;}bool flag = false;x2 = a[1];x3 = a[2];x1 = x2 + x3;if (x1 % 4){flag = true;}else{x1 /= 4;x4 = 3 * x1;if (x1 <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n", x1, x4);continue;}else{flag = true;}}bool flag2 = false;x2 = a[1];x4 = a[2];x1 = x4;if (x1 % 3){flag2 = true;}else{x3 = x1 + x4 - x2;if (x1 <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n", x1, x3);continue;}else{flag2 = true;}}bool flag3 = false;x3 = a[1];x4 = a[2];x1 = x4;x2 = x1 + x4 - x3;if (x1 % 3){flag3 = true;}else{if (x1 <= x2 && x2 <= x3 && x3 <= x4){printf("YES\n");printf("%d\n%d\n", x1, x2);continue;}else{flag3 = true;}}if (flag && flag2 && flag3){printf("NO\n");}}else{printf("YES\n");printf("1\n1\n3\n3\n");}}return 0;}
- Codeforces Round #278 (Div. 2)B—— Candy Boxes
- Codeforces Round #278 (Div. 2) B - Candy Boxes
- Codeforces Round #278 (Div. 2) B. Candy Boxes
- Codeforces Round #278 (Div. 2)B. Candy Boxes
- Codeforces Round #278 (Div. 2)---B. Candy Boxes (暴力+构造)
- Codeforces Round #278 (Div. 2) B. Candy Boxes (模拟,数学)
- Codeforces Round #229 (Div. 2) C. Inna and Candy Boxes
- Codeforces Round #229 (Div. 2)C. Inna and Candy Boxes
- Codeforces Round #229 (Div. 2)C - Inna and Candy Boxes心得
- Codeforces Round #229 (Div. 2) C. Inna and Candy Boxes ACM解题报告(预处理)
- codeforces 488B Candy Boxes
- Codeforces 488B - Candy Boxes (构造)
- Codeforces 488 B. Candy Boxes(构造)
- Codeforces 488B Candy Boxes(水)
- Codeforces Round #278 (Div. 2) A B
- Codeforces Round #278 (Div. 2) A, B
- Codeforces Round #278 (Div. 2) B
- Codeforces Round #154 (Div. 2)——B
- iOS实现地图定位(具体实现代码以及注释详解)
- ios scrollview 重用
- unity学习之循环习题整理
- cocos2dx 3.X 中 Menu, MenuItem 注意事项
- Mybatis 批量插入带oracle序列例子+ORA-02287: 此处不允许序号
- Codeforces Round #278 (Div. 2)B—— Candy Boxes
- Android 在frameworks中修改Setting中的默认值(一)
- DuiLib : 在Title区隐藏控件和拖动控件隐藏的区域
- throws和try catch的区别
- UVA--836 Largest Submatrix
- c++ 28 map
- POJ 1083 Moving Tables(贪心!!)
- 静态库
- SQL 中的 图 树 层次结构[转自http://blog.csdn.net/feixianxxx/article/details/4753783]