ZS和Chris的公交座位难题-CSDN博客

A - 1

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.

O+|+X

XO|XX

OX|OO

XX|OX

OO|OO

OO|XX
题目大意：如果两个座位同排同对，就被认为是相邻的。考虑到总线的配置，您能帮助ZS和Chris确定他们应该坐在哪里吗每个字符都等于“O”或“X”。‘o’表示空座位，‘X’表示已被占用的座位。有关详细信息，请参阅示例案例。其中Chris和ZS的座位对中的字符用字符‘+’进行更改。因此，配置应该与输入一个完全不同，只有两个字符(它们在输入中应该等于‘O’，在输出中应该等于‘+’)。如果没有用一行打印“no”(没有引号)。如果有多种解决方案，您可以打印其中任何一个。
思路：定义了一个新的类型；表示一排的坐位；然后进行比较。
代码如下（已AC）

#include<iostream>
using namespace std;
struct p
{
	char a;
	char b;
	char c;
	char d;
	char e;
};//定义新类型；
int main()
{
	int n;
	cin >> n;
	p*x = new p[n];
	for (int i = 0; i < n; i++)
		cin >> x[i].a >> x[i].b >> x[i].c >> x[i].d >> x[i].e;//输入
	for (int j = 0; j < n; j++)
	{
		if (x[j].a == 'O'&&x[j].b == 'O')
		{
			x[j].a = '+'; x[j].b = '+';
			cout << "YES" << endl;
			for (int i = 0; i < n; i++)
				cout << x[i].a << x[i].b << x[i].c << x[i].d << x[i].e << endl;
					delete[]x;
			return 0;
		}
		else if (x[j].d == 'O'&&x[j].e == 'O')
		{
			x[j].d = '+'; x[j].e = '+';
			cout << "YES" << endl;
			for (int i = 0; i < n; i++)
				cout << x[i].a << x[i].b << x[i].c << x[i].d << x[i].e << endl;
				delete[]x;
			return 0;
		}
	}
		delete[]x;
	cout << "no" << endl;
}