CodeForces 711A Bus to Udayland
来源:互联网 发布:free源码解析 编辑:程序博客网 时间:2024/04/30 11:05
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
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char s[1100][10];int main(){int t,i,j,k,l,n,m;while(scanf("%d",&n)!=EOF){int flag=0;for(i=0;i<n;i++){scanf("%s",s[i]);if(s[i][0]=='O'&&s[i][1]=='O'&&flag==0){flag=1;s[i][0]='+';s[i][1]='+';}else if(s[i][3]=='O'&&s[i][4]=='O'&&flag==0){flag=1;s[i][3]='+';s[i][4]='+';}}if(flag==0)printf("NO\n");else{printf("YES\n");for(i=0;i<n;i++){printf("%s",s[i]);printf("\n"); } }}return 0; }
- 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
- CodeForces 711A Bus to Udayland(水题)
- Codeforces Problem 711A Bus to Udayland(brute force+implementation)
- Codeforces-711A Bus to Udayland(找座位)
- codeforces——711A—— Bus to Udayland
- Codeforces Bus to Udayland
- A.Bus to Udayland
- A. Bus to Udayland
- A - Bus to Udayland
- Linux调整磁盘分区大小
- 1.8多文件程序
- 百度地图工具类
- C#编程启航(一)visual studio 2015 的安装与语言包
- 下载、安装及使用CocoaPods
- CodeForces 711A Bus to Udayland
- 摄像机标定
- 浅谈C/C++ 开发Excel插件之任务窗格
- Paraview 软件学习
- mysql时间字段值0000-00-00 00:00:00
- RF+AppiumLibrary移动端(android)自动化测试案例1:微信添加好友
- FreeMarker基本知识理论
- iOS综合练习 哈欠阅读
- 源码安装lnmp redis jenkins memcached