Codeforces Round #369 (Div. 2) A. Bus to Udayland【模拟】
2016-09-03 20:41
501 查看
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
output
input
output
input
output
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
原题链接:http://codeforces.com/contest/711/problem/A
题意:公共汽车座位,每一排有四个座位,中间的 '|' 代表过道,'O' 代表空位置,'X' 代表有人座,问你能否找到两个连在一起的座位(中间有过道不算),如果可以的话吧相应的符号变为 '+'。
简单模拟。
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn=1000+5;
char a[maxn][10];
int main()
{
int n;
ios::sync_with_stdio(false);
//freopen("A.txt","r",stdin);
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
bool flag=false;
for(int i=0;!flag&&i<n;i++)
{
for(int j=0;j<5;j+=3)
{
if(a[i][j]=='O'&&a[i][j+1]=='O')
{
a[i][j]=a[i][j+1]='+';
flag=true;
break;
}
}
}
if(flag)
{
cout<<"YES"<<endl;
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
}
else
cout<<"NO"<<endl;
}
return 0;
}
尊重原创,转载请注明出处:http://blog.csdn.net/hurmishine
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
原题链接:http://codeforces.com/contest/711/problem/A
题意:公共汽车座位,每一排有四个座位,中间的 '|' 代表过道,'O' 代表空位置,'X' 代表有人座,问你能否找到两个连在一起的座位(中间有过道不算),如果可以的话吧相应的符号变为 '+'。
简单模拟。
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn=1000+5;
char a[maxn][10];
int main()
{
int n;
ios::sync_with_stdio(false);
//freopen("A.txt","r",stdin);
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
bool flag=false;
for(int i=0;!flag&&i<n;i++)
{
for(int j=0;j<5;j+=3)
{
if(a[i][j]=='O'&&a[i][j+1]=='O')
{
a[i][j]=a[i][j+1]='+';
flag=true;
break;
}
}
}
if(flag)
{
cout<<"YES"<<endl;
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
}
else
cout<<"NO"<<endl;
}
return 0;
}
尊重原创,转载请注明出处:http://blog.csdn.net/hurmishine
相关文章推荐
- C#模拟http 发送post或get请求的简单实例
- Transformation 能将 Windows XP/Server 2003 操作系统,完美地模拟成 Windows Vista 的软件
- 用javascript和css模拟select的脚本
- PHP模拟asp.net的StringBuilder类实现方法
- C#使用ImitateLogin模拟登录百度
- javascript用层模拟可移动的小窗口
- JS模拟简易滚动条效果代码(附demo源码)
- 自编jQuery插件实现模拟alert和confirm
- JS模拟按钮点击功能的方法
- JS模拟的Map类实现方法
- PHP模拟asp中response类实现方法
- 模拟Spring的简单实现
- javascript 模拟点击广告
- JQuery中模拟image的ajaxPrefilter与ajaxTransport处理
- php实现模拟post请求用法实例
- JavaScript实现MIPS乘法模拟的方法
- 模拟xcopy的函数
- JS模拟实现Select效果代码
- php模拟服务器实现autoindex效果的方法
- C# SendInput 模拟鼠标操作的实现方法