2013暑假集训B组训练赛第二场 - E Queue at the School

104 阅读 0 评论 69 点赞

我是靠谱客的博主优秀小蚂蚁，这篇文章主要介绍2013暑假集训B组训练赛第二场 - E Queue at the School，现在分享给大家，希望可以做个参考。

E - Queue at the School

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 266B

Description

During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.

Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 ton, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.

You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after tseconds.

Input

The first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.

The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals "B", otherwise the i-th character equals "G".

Output

Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal "B", otherwise it must equal "G".

Sample Input

Input

复制代码

1
5 1
BGGBG

Output

复制代码

1
GBGGB

Input

复制代码

1
5 2
BGGBG

Output

复制代码

1
GGBGB

Input

复制代码

1
4 1
GGGB

Output

复制代码

1
GGGB

依然是水题，犯二了，开始还弄了几个数组

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <cstdio>
int x, y;
int main()
{
while(~scanf("%d%d",&x,&y))
{
while(x >= 0&& y>=0)
{
if(x>=2 && y >= 2)
{
x -= 2;
y -= 2;
}
else if(x==1 && y >= 12)
{
x -= 1;
y -= 12;
}
else if(x== 0 && y>=22)
{
y -= 22;
}
else
{
puts("Ciel");
break;
}
if(y>=22)
{
y -= 22;
}
else if(y>=12 && x >=1)
{
x -= 1;
y -= 12;
}
else if(x>= 2 && y >=2)
{
x -= 2;
y -= 2;
}
else
{
puts("Hanako");
break;
}
}
}
}