【CodeForces 282B】Painting Eggs(模拟)
来源:互联网 发布:淘宝uv价值公式 编辑:程序博客网 时间:2024/05/16 17:01
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because just as is customary, they're going to be paid for the job!
Overall uncle J. has got n eggs. G. named his price for painting each egg. Similarly, A. named his price for painting each egg. It turns out that for each egg the sum of the money both A. and G. want for the painting equals 1000.
Uncle J. wants to distribute the eggs between the children so as to give each egg to exactly one child. Also, Uncle J. wants the total money paid to A. to be different from the total money paid to G. by no more than500.
Help Uncle J. Find the required distribution of eggs or otherwise say that distributing the eggs in the required manner is impossible.
The first line contains integer n (1 ≤ n ≤ 106) — the number of eggs.
Next n lines contain two integers ai andgi each(0 ≤ ai, gi ≤ 1000; ai + gi = 1000):ai is the price said by A. for thei-th egg and gi is the price said by G. for thei-th egg.
If it is impossible to assign the painting, print "-1" (without quotes).
Otherwise print a string, consisting of n letters "G" and "A". Thei-th letter of this string should represent the child who will get thei-th egg in the required distribution. Letter "A" represents A. and letter "G" represents G. If we denote the money Uncle J. must pay A. for the painting as Sa, and the money Uncle J. must pay G. for the painting asSg, then this inequality must hold:|Sa - Sg| ≤ 500.
If there are several solutions, you are allowed to print any of them.
21 999999 1
AG
3400 600400 600400 600
AGA
题目大意:有n个鸡蛋,分给A和G两个人,每个人的对每个鸡蛋的价格不同,如何分配能保证|Sa - Sg|<=500
思路:不太明白题目的用意是什么,两个和为1000有什么用,反正我就模拟了一下,可能有什么深意没领会到吧
#include<iostream>#include<cstdio> #include<cstdlib>#define manx 1000005using namespace std;int main(){ int n,suma=0,sumg=0,a,g; int cot=0; char s[manx]; scanf("%d",&n); for (int i=0; i<n; i++){ scanf("%d%d",&a,&g); if(suma + a > sumg + 500){ sumg+=g; s[cot++]='G'; } else{ suma+=a; s[cot++]='A'; } } if(abs(suma - sumg) > 500){ printf("-1\n"); return 0; } for (int i=0; i<cot; i++) printf("%c",s[i]); printf("\n"); return 0;}
- 【CodeForces 282B】Painting Eggs(模拟)
- codeforces 282B - Painting Eggs
- Painting Eggs CodeForces
- B. Painting Eggs
- Painting Eggs
- B. Painting Pebbles(Codeforces Round #289 )
- Codeforces #353(div2)B.Restoring Painting
- CodeForces 282BPainting Eggs
- CodeForces 282BPainting Eggs
- CodeForces 509B Painting Pebbles
- CodeForces 509B Painting Pebbles
- CodeForces-509B Painting Pebbles
- codeforces 675B Restoring Painting
- CodeForces 509B Painting Pebbles
- CodeForces 675B Restoring Painting
- 【Codeforces】675B - Restoring Painting
- 【CodeForces】[675B]Restoring Painting
- CodeForces 675B Restoring Painting
- 本人的oi之路————————序
- OneThink+PHPExcel灵活适应导出数据Excel表(导出)
- Nginx日志文件的配置
- 初步了解-泛型
- 简单却又复杂的FizzBuzz面试编程问题
- 【CodeForces 282B】Painting Eggs(模拟)
- Activiti工作流之初识BPMN
- 通过java调用SVN API 实现代码的checkout update commit
- JavaScript 练习题
- BZOJ-2038 小Z的袜子(hose) (莫队算法)
- 部署一套私有云需要多少时间
- 初步了解-反射
- 项目期间hadoop完全分布式安装配置过程
- 特殊的回文数