CodeForces 282BPainting Eggs
来源:互联网 发布:摄像头实时传输数据 编辑:程序博客网 时间:2024/06/05 14:15
Description
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 than 500.
Help Uncle J. Find the required distribution of eggs or otherwise say that distributing the eggs in the required manner is impossible.
Input
The first line contains integer n(1 ≤ n ≤ 106) — the number of eggs.
Next n lines contain two integers ai and gi each (0 ≤ ai, gi ≤ 1000; ai + gi = 1000): ai is the price said by A. for the i-th egg andgi is the price said by G. for the i-th egg.
Output
If it is impossible to assign the painting, print "-1" (without quotes).
Otherwise print a string, consisting of n letters "G" and "A". The i-th letter of this string should represent the child who will get the i-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 as Sg, then this inequality must hold: |Sa - Sg| ≤ 500.
If there are several solutions, you are allowed to print any of them.
Sample Input
21 999999 1
AG
3400 600400 600400 600
AGA
题意:第一个数N表示鸡蛋数,然后n行分别是A,G提供的钱,要求你每次选一个人获得相应的鸡蛋,然后获得相应的钱数。选择过程中要求满足:|Sa-Sg|<=500,Sa,Sg分别表示获得的钱数的和。
思路:贪心,每次选择的人确保要求的条件最小就可以,如果超过了500说明不可能满足条件,比较无脑。
#include <iostream>#include <bits/stdc++.h>using namespace std;const int MAXN=1000000+10;int a[MAXN],b[MAXN];int n;char s[MAXN];int main(){ int sum1=0,sum2=0; scanf("%d",&n); int i,j; for(i=0;i<n;++i)scanf("%d%d",&a[i],&b[i]); int cnt=0; for(i=0;i<n;++i) { if(abs(sum1+a[i]-sum2)<=abs(sum1-(sum2+b[i]))) { sum1+=a[i]; s[cnt++]='A'; } else { sum2+=b[i]; s[cnt++]='G'; } if(abs(sum1-sum2)>500) { puts("-1"); break; } } s[cnt]=0; if(i==n)puts(s); return 0;}
- CodeForces 282BPainting Eggs
- CodeForces 282BPainting Eggs
- codeforces 282B - Painting Eggs
- 【CodeForces 282B】Painting Eggs(模拟)
- Painting Eggs CodeForces
- eggs
- Python Eggs
- Painting Eggs
- two eggs
- Eggs简介
- Drop Eggs
- Eggs Dropping puzzle(2 eggs, 100 floors)
- What is Easter Eggs?
- Permission denied: ... .python-eggs
- [转]install Python eggs
- B. Painting Eggs
- Eggs and Egg Info
- python-eggs异常解决方法
- 安卓开发 市场需求技能
- 变态跳台阶
- mac下安装mysql 5.7.13
- tomcat web.xml 配置详解
- 魔鬼数学读书笔记
- CodeForces 282BPainting Eggs
- Java中创建对象的5种方式
- Android5.0新特性:主题样式
- 正则表达式——JAVA与JS中的使用
- 51nod 1065 最小正子段和
- Android 关于日历的搭建
- D3D9 Shader实例教程
- ural 1981. Parallel and Perpendicular 【规律】
- JAVA设计模式之单例模式