zoukankan      html  css  js  c++  java
  • CodeForces-266B 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".

    Examples
    input
    Copy
    5 1
    BGGBG
    
    output
    Copy
    GBGGB
    
    input
    Copy
    5 2
    BGGBG
    
    output
    Copy
    GGBGB
    
    input
    Copy
    4 1
    GGGB
    
    output
    Copy
    GGGB


    数据范围比较小,根据题意暴力模拟。

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <functional>
    #include <iostream>
    using namespace std;
    char que[55];
    int main(){
        int n,t;
        scanf("%d %d
    ",&n,&t);
        scanf("%s",que);
        for(int i=0;i<t;i++){
            for (int j=0;j<n;){
                if(que[j]=='B'){
                    if(que[j+1]=='G'){
                        que[j]='G';
                        que[j+1]='B';
                        j+=2;
                    }
                    else j++;
                }
                else j++;
            }
        }
        printf("%s
    ",que);
        return 0;
    }
    

  • 相关阅读:
    centos7 使用postgres
    centos7 Authentication failure
    centos 安装 jdk PostgreSQL
    JS遍历对象或者数组
    PHP简单 对象(object) 与 数组(array) 的转换
    IDEA 配置Tomcat 跑Jeecg项目
    kettle 安装mysql 驱动
    : Could not open a connection to your authentication agent
    java_Ninja实战过程
    设备判断
  • 原文地址:https://www.cnblogs.com/acerkoo/p/9490341.html
Copyright © 2011-2022 走看看