제출 #332991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
332991		andrix007	Red-blue table (IZhO19_stones)	C++14	27 / 100	51 ms	1516 KiB

stones

#include <iostream>

using namespace std;

int t;

int main()
{
	cin >> t;
	while (t--)
	{
		int m, n;
		cin >> m >> n;
		if (m == n)
		{
			if (m & 1)
				cout << m + n / 2 << '\n';
			else
				cout << m + n / 2 - 1 << '\n';
			for (int i = 1; i <= m; i++)
			{
				for (int j = 1; j <= n / 2 + 1; j++)
					cout << '+';
				for (int j = n / 2 + 2; j <= n; j++)
					cout << '-';
				cout << '\n';
			}
		}
		else if (n > m) /// mai multe coloane decat randuri
		{
			int sum = n;
			if (m & 1)
				sum += m / 2;
			else
				sum += m / 2 - 1;
			cout << sum << '\n';
			for (int i = 1; i <= m / 2 + 1; i++)
			{
				for (int j = 1; j <= n; j++)
					cout << '-';
				cout << '\n';
			}
			for(int i = m/2+2 ; i <= m ; i++)
			{
				for (int j = 1; j <= n; j++)
					cout << '+';
				cout << '\n';
			}
		}
		else if (m > n) /// mai multe randuri decat coloane
		{
			int sum = m;
			if (n & 1)
				sum += n / 2;
			else
				sum += n / 2 - 1;
			cout << sum << '\n';
			for (int i = 1; i <= m; i++)
			{
				for (int j = 1; j <= n / 2 + 1; j++)
					cout << '+';
				for (int j = n / 2 + 2; j <= n; j++)
					cout << '-';
				cout << '\n';
			}
		}
	}
	return 0;
}

• Subtask 1: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31