A. Bus to Udayland
来源:互联网 发布:天刀男捏脸数据公子羽 编辑:程序博客网 时间:2024/05/17 01:03
题目链接:http://codeforces.com/problemset/problem/711/A
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?
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.
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.
6OO|OXXO|XXOX|OOXX|OXOO|OOOO|XX
YES++|OXXO|XXOX|OOXX|OXOO|OOOO|XX
4XO|OXXO|XXOX|OXXX|OX
NO
5XX|XXXX|XXXO|OXXO|OOOX|XO
YESXX|XXXX|XXXO|OXXO|++OX|XO
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
找到相邻的OO,换成++,再把它输出来。i是自己决定的输入的每一行,可以从下标1开始,而每行的输入默认是从0开始的,所以j是从0开始的。
#include<iostream>#include<cstdio>using namespace std;int main(){int n;char str[1001][6];while(~scanf("%d",&n)){bool flag=0;for(int i=1;i<=n;i++){scanf("%s",&str[i]);}for(int i=1;i<=n;i++){for(int j=0;j<5;j++){if(str[i][j]=='O'&&str[i][j+1]=='O'){str[i][j]='+';str[i][j+1]='+';flag=1;break;}}if(flag)break;}if(flag){cout<<"YES"<<endl;for(int i=1;i<=n;i++){cout<<str[i]<<endl;}}elsecout<<"NO"<<endl;}return 0;}
#include<iostream>#include<cstdio>using namespace std;int main(){int n;char str[1002][6];while(~scanf("%d",&n)){bool flag=0; for(int i=1;i<=n;i++){scanf("%s",&str[i]);}for(int i=1;i<=n;i++){if(str[i][0]=='O'&&str[i][1]=='O'){str[i][0]='+';str[i][1]='+';flag=1;break;}else if(str[i][3]=='O'&&str[i][4]=='O'){str[i][3]='+';str[i][4]='+';flag=1;break;}}if(flag){cout<<"YES"<<endl;for(int i=1;i<=n;i++){cout<<str[i]<<endl;}}elsecout<<"NO"<<endl;}return 0;}
- A.Bus to Udayland
- A. Bus to Udayland
- A - Bus to Udayland
- A. Bus to Udayland
- CodeForces 711A A. Bus to Udayland
- codeforces 711A.Bus to Udayland 【水题】
- Codeforces 711A Bus to Udayland
- 【模拟】Codeforces 711A Bus to Udayland
- Codeforces 711A- Bus to Udayland
- Codeforces-711A-Bus to Udayland
- CodeForces 711A. Bus to Udayland【StringBuilder】
- CodeForces 711A Bus to Udayland
- codeforces 711 A. Bus to Udayland
- Codeforces 711A Bus to Udayland
- CF 711 A. Bus to Udayland
- 【codeforces711B】Bus to Udayland
- Bus to Udayland
- Codeforces Bus to Udayland
- linux nginx完全卸载
- QmlImageProvider
- Kafka架构图
- iOS与网页JS交互,看我就够了
- CodeForces
- A. Bus to Udayland
- tensorflow手册实现mnist数据集的CNN
- tf install
- 问题:The resource identified by this request is only capable of generating responses with characterist
- 测试分布式系统的线性一致性
- 使用Spring注解AOP(基于自定义注解和包下拦截方法)
- HDU-5974-A Simple Math Problem
- 解决keil打开工程无响应
- Lua学习笔记10-元表与元方法