211052026-01-12 11:47:07PappMatyasKombináció (50)cpp17Wrong answer 33/501ms508 KiB
#include <iostream>
#include <vector>

using namespace std;

static void WriteOut(vector<int> a)
{
	for (int x : a)
	{
		cout << x << " ";
	}
	cout << endl;
}

int main()
{
	int n, m;
	cin >> n >> m;
	vector<int> seats(m);
	for (int i = 0; i < m; i++)
	{
		cin >> seats[i];
	}
	int lower = 0;
	for (int i = m - 1; i >= 1; i--)
	{
		if (seats[i] - 1 > seats[i - 1])
		{
			lower = i;
			break;
		}
	}
	seats[lower]--;
	WriteOut(seats);
	seats[lower]++;

	int higher = 0;
	if (seats[m - 1] + 1 <= n)
	{
		higher = m - 1;
		seats[higher]++;
		WriteOut(seats);
		seats[higher]--;
	}
	else
	{
		for (int i = m - 2; i >= 0; i--)
		{
			if (seats[i] + 1 < seats[i + 1])
			{
				higher = i;
				break;
			}
		}
		seats[higher]++;
		WriteOut(seats);
		seats[higher]--;	
	}
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base33/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms508 KiB
6Partially correct1/21ms316 KiB
7Partially correct1/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Partially correct1/21ms316 KiB
10Partially correct2/41ms316 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms316 KiB
13Accepted4/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms316 KiB
17Partially correct3/61ms316 KiB