codeforces #386 div2 D. Green and Black Tea

最新推荐文章于 2022-11-22 23:15:14 发布

Hanylch

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量330

点赞数

本文链接：https://blog.csdn.net/zhuanshunzhe/article/details/53749644

版权

acm 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Innokentiy计划喝n杯茶，他有a袋绿茶和b袋红茶，但他不想连续喝超过k杯同一种茶。你的任务是确定泡茶顺序，使得Innokentiy能按要求喝到n杯茶，或者判断这是否不可能。每袋茶只能用一次。

摘要由CSDN通过智能技术生成

Innokentiy likes tea very much and today he wants to drink exactly n cups of tea. He would be happy to drink more but he had exactly n tea bags, a of them are green and b are black.

Innokentiy doesn't like to drink the same tea (green or black) more than k times in a row. Your task is to determine the order of brewing tea bags so that Innokentiy will be able to drink n cups of tea, without drinking the same tea more than k times in a row, or to inform that it is impossible. Each tea bag has to be used exactly once.

Input

The first line contains four integers n, k, a and b (1 ≤ k ≤ n ≤ 105, 0 ≤ a, b ≤ n) — the number of cups of tea Innokentiy wants to drink, the maximum number of cups of same tea he can drink in a row, the number of tea bags of green and black tea. It is guaranteed that a + b = n.

Output

If it is impossible to drink n cups of tea, print "NO" (without quotes).

Otherwise, print the string of the length n, which consists of characters 'G' and 'B'. If some character equals 'G', then the corresponding cup of tea should be green. If some character equals 'B', then the corresponding cup of tea should be black.

If there are multiple answers, print any of them.

        Examples 
      
          input 
        
5 1 3 2

          output 
        
GBGBG

          input 
        
7 2 2 5

          output 
        
BBGBGBB

          input 
        
4 3 4 0

          output 
        
NO

#include<stdio.h>
char str[100100];

int main()
{
	int n,k,a,b;
	scanf("%d%d%d%d",&n,&k,&a,&b);
	char A='G',B='B';
	if( a > b)
	{
		a^=b^=a^=b;
		A^=B^=A^=B;
	}
	for(int i=0;i<n;i++)
		str[i] = B;
		
	for(int i=k;i<n;i += k+1)
		{
			if( a == 0)
				{
					printf("NO\n");
					return 0;
				}
			str[i]=A;
			a--;
		}
	for(int i=0;i<n && a > 0;i++)
		{
			if( str[i] == A || ( i-1>0 && str[i-1] == A ) || ( i+1<n && str[i+1] ==A))
				continue;
			str[i] = A;
			a--;
		}
	for(int i=0;i<n;i++)
		printf("%c",str[i]);
		
	return 0;
}