关闭

水题-Codeforces Round #369 Div.2-A

标签: codeforcesacm
176人阅读 评论(0) 收藏 举报
分类:

A. Bus to Udayland
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 n rows 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


题意:
找到那堆输入里连续两个O,替换成++,若没有就输出NO,有则输出YES和替换后的图。


题解:
太水。


//
//  main.cpp
//  cf-369-2-1
//
//  Created by 袁子涵 on 16/8/29.
//  Copyright © 2016年 袁子涵. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <map>

using namespace std;
const int MAXN=1005;
int n;
char a[MAXN],b[MAXN],c[MAXN],d[MAXN];
int main(int argc, const char * argv[]) {
    bool flag=0;
    cin >> n;
    for (int i=1; i<=n; i++) {
        cin >> a[i] >> b[i] >> c[i] >> c[i] >> d[i];
        if (!flag) {
            if (a[i]==b[i] && a[i]=='O') {
                flag=1;
                a[i]=b[i]='+';
            }
            else if (c[i]==d[i] && c[i]=='O')
            {
                flag=1;
                c[i]=d[i]='+';
            }
        }
    }
    if (flag) {
        puts("YES");
        for (int i=1; i<=n; i++) {
            cout << a[i] << b[i] << '|' << c[i] << d[i] << endl;
        }
    }
    else
        puts("NO");
    return 0;
}
0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

codeforces 237/A 一道水题的感悟。。。。

http://codeforces.com/problemset/problem/237/A Valera runs a 24/7 fast food cafe. He magically ...
  • u013573047
  • u013573047
  • 2014-04-08 17:57
  • 683

Codeforces Round #406 (Div. 2):C. Berzerk(记忆化搜索解决博弈问题)

C. Berzerk time limit per test 4 seconds memory limit per test 256 megabytes input standard in...
  • Jaihk662
  • Jaihk662
  • 2017-03-24 15:23
  • 786

【Codeforces Round 375 (Div 2) E】【欧拉回路Fleury算法 或网络流】One-Way Reform 每条边定向使得最多的点满足入度=出度

E. One-Way Reform time limit per test 2 seconds memory limit per test 256 megabytes ...
  • snowy_smile
  • snowy_smile
  • 2016-10-04 10:20
  • 735

Codeforces 375D 数据结构(好题中的好题, 4解)

题目链接:http://codeforces.com/problemset/problem/375/D 全部代码: 题意:给你一棵树n个点,m次询问(n=100000,m=100000),每个节点有一...
  • c3568
  • c3568
  • 2014-03-25 19:38
  • 1423

CodeForces 171F(千古神题。。)

CF神题
  • sky_miange
  • sky_miange
  • 2015-02-12 19:01
  • 601

一些Codeforces的水题

713A用二进制状态记录每一位的奇偶性,把答案存在数组里713B第一步要把两个矩形隔离,要么从x轴隔开,要么从y轴隔开,判断的条件一定是两边区域都各有一个完整的矩形。接下来二分矩形的四条边就行了713...
  • MatouKariya
  • MatouKariya
  • 2017-04-05 14:44
  • 160

codeforces 627 problem A 好题呀,感觉学到了挺多的 亦或

A. XOR Equation time limit per test 2 seconds memory limit per test 256 megabytes input standa...
  • zcj5027
  • zcj5027
  • 2016-03-24 21:11
  • 693

codeforces Line 7C (拓展欧几里德+思想 模板) 好题

C. Line Description A line on the plane is described by an equation Ax + By + C = 0. You are to f...
  • yanghui07216
  • yanghui07216
  • 2015-10-24 21:04
  • 382

题目推荐—BZOJ 水题推荐

[bzoj1756]Vijos1083小白逛公园 裸题- -。。线段树维护lmax,rmax,max,sum然后搞之。。 [Ahoi2008]Meet 紧急集合 求两两点的lca然后会发现必然有两个l...
  • u011400953
  • u011400953
  • 2013-07-16 15:26
  • 3147

Codeforces 798D Mike and distribution【思维+贪心】好题!好题!感觉智商受到了一万点伤害= =

D. Mike and distribution time limit per test 2 seconds memory limit per test 256 megabytes ...
  • mengxiang000000
  • mengxiang000000
  • 2017-05-03 21:19
  • 403
    个人资料
    • 访问:47734次
    • 积分:1925
    • 等级:
    • 排名:千里之外
    • 原创:154篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条
    最新评论