codeforces 711A.Bus to Udayland 【水题】
来源:互联网 发布:淘宝直通车没流量 编辑:程序博客网 时间:2024/05/21 11:28
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
/* 题意:有n排座位,每排座位包含左右两部分,被'|'分隔,其中'O'代表没人坐, 问你是否存在连续的两个座位没人坐,存在输出YES,并把这两个座位改为"++", 输出修改以后的情况,不存在输出NO. 类型:水题 分析:直接模拟即可 */#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;typedef long long ll;char s[1000+5][10];int main(){ int n; cin>>n; int flag1=-1; int flag2=-1; for(int i=0;i<n;i++){ cin>>s[i]; if(s[i][0]=='O'&&s[i][1]=='O'){ flag1=i; flag2=0; } else if(s[i][3]=='O'&&s[i][4]=='O'){ flag1=i; flag2=1; } } if(flag1==-1){ cout<<"NO"<<endl; } else{ cout<<"YES"<<endl; for(int i=0;i<n;i++){ if(flag1==i){ if(flag2==0){ printf("++"); for(int j=2;j<5;j++){ printf("%c",s[i][j]); } printf("\n"); } else if(flag2==1){ for(int j=0;j<3;j++){ printf("%c",s[i][j]); } printf("++\n"); } } else{ printf("%s\n",s[i]); } } } return 0;}
- codeforces 711A.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【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 #369(Div.2)A. Bus to Udayland【水题】
- Codeforces Bus to Udayland
- A.Bus to Udayland
- A. Bus to Udayland
- 【Linux网络编程】TCP网络编程中connect()、listen()和accept()三者之间的关系
- java nio学习之 socket+nio 通信
- 安卓面试题大全,有答案哦
- BASE64
- javascript双等号引起的类型转换,js隐性类型转换步骤
- codeforces 711A.Bus to Udayland 【水题】
- Android studio 中获取SHA1的方法
- 用模板实现单链表
- canvas分享之用户交互
- static修饰属性
- ContentProvider
- qt学习 实训第三天,第四天
- 如何优化appium-IOS的自动化测试运行的速度
- 如何用maven创建nexus私服并将包打包发布到私服