zoukankan      html  css  js  c++  java
  • CF266 B. Queue at the School

    B. Queue at the School
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 to n, 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 t seconds.

    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 test(s)
    input
    5 1
    BGGBG
    output
    GBGGB
    input
    5 2
    BGGBG
    output
    GGBGB
    input
    4 1
    GGGB
    output
    GGGB
     1 #include <iostream>
     2 #include <cstdlib>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 int main(void)
     9 {
    10     //freopen("266B.in", "r", stdin);
    11     int n, t;
    12     char a[50+10];
    13     while (~scanf("%d%d", &n, &t))
    14     {
    15         scanf("%s", a);
    16         for (int i = 0; i < t; ++i)
    17         {
    18             for (int j = 0; j < n; )
    19             {
    20                 if (a[j] == 'B' && a[j+1] == 'G')
    21                 {
    22                     char temp; temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; 
    23                     j+=2;
    24                 }
    25                 else j++;
    26             }
    27         }
    28         printf("%s\n", a);
    29     }
    30 
    31     return 0;
    32 }

    水题……发现CF上的代码各种精简啊!

  • 相关阅读:
    Pycharm 调试system-config-users
    只写了两行代码,为什么要花两天时间?
    为开源做贡献的6个技巧
    2020年10月编程语言排行榜
    全球最厉害的 14 位程序员
    6_38_二叉树的后序遍历非递归算法(和先序有些许不一样)
    6_37_二叉树的先序遍历非递归算法
    6_36_相似二叉树
    6_33_两个一维数组判断u是否为v的子孙
    6_34_扩展判断u是否为v的子孙
  • 原文地址:https://www.cnblogs.com/liuxueyang/p/2872632.html
Copyright © 2011-2022 走看看