zoukankan      html  css  js  c++  java
  • Codeforces Round #369 (Div. 2) A. Bus to Udayland【字符串/二维字符数组求连起来的座位并改为其他字符】

    A. Bus to Udayland
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has nrows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.

    ZS and Chris are good friends. They insist to get a pair of neighbouring empty seats. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of rows of seats in the bus.

    Then, n lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '|') and the last two of them denote the second pair of seats in the row.

    Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, 'X' denotes an occupied seat. See the sample cases for more details.

    Output

    If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next n lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by exactly two charaters (they should be equal to 'O' in the input and to '+' in the output).

    If there is no pair of seats for Chris and ZS, print "NO" (without quotes) in a single line.

    If there are multiple solutions, you may print any of them.

    Examples
    input
    6
    OO|OX
    XO|XX
    OX|OO
    XX|OX
    OO|OO
    OO|XX
    output
    YES
    ++|OX
    XO|XX
    OX|OO
    XX|OX
    OO|OO
    OO|XX
    input
    4
    XO|OX
    XO|XX
    OX|OX
    XX|OX
    output
    NO
    input
    5
    XX|XX
    XX|XX
    XO|OX
    XO|OO
    OX|XO
    output
    YES
    XX|XX
    XX|XX
    XO|OX
    XO|++
    OX|XO
    Note

    Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair.

    O+|+X

    XO|XX

    OX|OO

    XX|OX

    OO|OO

    OO|XX

    【分析】:我,傻逼,把字符数组写错成了整型数组,De了好久bug!

    【代码】:

    #include <bits/stdc++.h>
    
    using namespace std;
    char a[1010][10];
    int main()
    {
        int n;
        while(~scanf("%d",&n))
        {
            for(int i=0;i<n;i++)
            {
                scanf("%s",a[i]);
            }
            int f=0;
            for(int i=0;i<n;i++)
            {
                if(a[i][1]==a[i][0]&&a[i][0]=='O')
                {
                    f=1;
                    a[i][0]=a[i][1]='+';
                    break;
                }
                if(a[i][3]==a[i][4]&&a[i][3]=='O')
                {
                    f=1;
                    a[i][3]=a[i][4]='+';
                    break;
                }
            }
            if(f==1)
            {
                printf("YES
    ");
                for(int i=0;i<n;i++)
                {
                    for(int j=0;j<5;j++)
                    {
                        printf("%c",a[i][j]);
                    }
                    printf("
    ");
                }
            }
            else
            {
                printf("NO
    ");
            }
        }
        return 0;
    }
    注意是char数组!
    void print1(int n)
    {
        for(i=0;i<n;i++)  
            {  
                    printf("%s",s[i]);  
                    printf("
    ");   
            } 
    } 
    
    void print2(int n)
    {
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < 5; j++)
            {
                cout << s[i][j];
            }
            cout << '
    ';
        }
    }
  • 相关阅读:
    Nginx upstream的5种权重分配方式分享
    MySQL——约束(constraint)详解---转载
    analysis简介 --转载
    软件测试工具LoadRunner中如何定义SLA?--转载
    jemeter如何设置用户取参数唯一不重复---------转载
    loadrunner中web_reg_find函数的用法及测试脚本实例
    LoadRunner中将中文转换为URL编码类型的方法
    LoadRunner字符串编码转换函数:lr_convert_string_encoding
    Loadrunner模拟JSON接口请求进行测试
    http请求数据的方式以及格式
  • 原文地址:https://www.cnblogs.com/Roni-i/p/7953473.html
Copyright © 2011-2022 走看看