【CodeForces 282B】Painting Eggs（模拟）

最新推荐文章于 2019-09-05 18:46:54 发布

_FSMM

最新推荐文章于 2019-09-05 18:46:54 发布

阅读量522

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟 CF

本文链接：https://blog.youkuaiyun.com/fsmm_blog/article/details/61204959

CF 同时被 2 个专栏收录

40 篇文章

订阅专栏

模拟

19 篇文章

订阅专栏

本文介绍了一个关于如何公平分配鸡蛋的问题，并提供了一种通过编程模拟的方法来解决该问题。问题中涉及两个孩子A和G，他们对每个鸡蛋有不同的定价。文章提供了一个C++程序示例，用于找到一种分配方式使得两方获得的总金额之差不超过500。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. Painting Eggs

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 10⁶) — the number of eggs.

Next n lines contain two integers a_i and g_i each (0 ≤ a_i, g_i ≤ 1000; a_i + g_i = 1000): a_i is the price said by A. for the i-th egg and g_i 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 S_a, and the money Uncle J. must pay G. for the painting as S_g, then this inequality must hold: |S_a - S_g| ≤ 500.

If there are several solutions, you are allowed to print any of them.

Examples

Input

2
1 999
999 1

Output

AG

Input

Output

AGA

题目大意：有n个鸡蛋，分给A和G两个人，每个人的对每个鸡蛋的价格不同，如何分配能保证|Sa - Sg|<=500

思路：不太明白题目的用意是什么，两个和为1000有什么用，反正我就模拟了一下，可能有什么深意没领会到吧

#include<iostream>
#include<cstdio>     
#include<cstdlib>
#define manx 1000005
using 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;
}