Submission #498546

#	Time	Username	Problem	Language	Result	Execution time	Memory
498546		The_Samurai	Red-blue table (IZhO19_stones)	C++98	27 / 100	29 ms	1216 KiB

stones

#include <bits/stdc++.h>
 
using namespace std;
 
void solve() {
	int n, m, ans, x = 1;
	
	cin >> n >> m;
	if (n == 1) {
		cout << m << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		return;
	}
	if (n == 2) {
		if (m == 1) {
			cout << "2\n";
			cout << "+\n+\n";
			return;
		}
		cout << m << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		return;
	}
	if (n == 3) {
		if (m == 1) {
			cout << "3\n";
			cout << "+\n+\n+\n";
			return;
		}
		cout << m + 1 << '\n';
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < m; j++) {
				cout << '-';
			}
			cout << '\n';
		}
		for (int i = 0; i < m; i++) {
			cout << '+';
		}
		cout << '\n';
		return;
	}
	if (m <= 2) {
		cout << n << '\n';
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << '+';
			}
			cout << '\n';
		}
		return;
	}
	if (m == 3) {
		cout << n + 1 << '\n';
		for (int i = 0; i < n; i++) {
			cout << "++-\n";
		}
		cout << '\n';
		return;
	}
	if (n == 4 && m == 4) {
		cout << "5\n";
		cout << "++++\n----\n----\n----\n";
		return;
	}
	if (n == m) {
		int x = 0;
		if (n % 2 == 0) {
			x = 1;
		}
		cout << n + 1 + n % 2 + x << '\n';
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m / 2 + m % 2 + x; j++) {
				cout << '+';
			}
			for (int j = m / 2 + m % 2 + x; j < m; j++) {
				cout << '-';
			}
			cout << '\n';
		}
		return;
	}
}
 
int main() {
	int t;
	
	cin >> t;
	while (t--) {
		solve();
	}
}

Compilation message (stderr)

stones.cpp: In function 'void solve()':
stones.cpp:6:12: warning: unused variable 'ans' [-Wunused-variable]
    6 |  int n, m, ans, x = 1;
      |            ^~~
stones.cpp:6:17: warning: unused variable 'x' [-Wunused-variable]
    6 |  int n, m, ans, x = 1;
      |                 ^

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