oj.uz

Submission #498581

# Submission time Handle Problem Language Result Execution time Memory
498581 2021-12-25T14:58:35 Z The_Samurai Red-blue table (IZhO19_stones) C++
0 / 100
 63 ms 1540 KB 
#include <bits/stdc++.h>
 
using namespace std;

/*

6 6
++++--
------
------
--++++
--++++
7 7
++++---
++++---
++++---
---+---
---++++
---++++
---++++
*/

void solve() {
	int n, m;
	
	cin >> n >> m;
	if (n == 1) {
		cout << "1\n+\n";
		return;
	}
	if (n % 2 == 0) {
		int x = 1 - n % 2;
		cout << n + (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;
	}
	cout << 2 * n - 2 << '\n';
	for (int i = 0; i < n / 2; i++) {
		for (int j = 0; j < n / 2 + n % 2; j++) {
			cout << '+';
		}
		for (int j = n / 2 + n % 2; j < n; j++) {
			cout << '-';
		}
		cout << '\n';
	}
	for (int i = 0; i < n; i++) {
		cout << '-';
	}
	cout << '\n';
	for (int i = 0; i < n / 2; i++) {
		for (int j = 0; j < n / 2 ; j++) {
			cout << '-';
		}
		for (int j = n / 2; j < n; j++) {
			cout << '+';
		}
		cout << '\n';
	}
}
 
int main() {
	int t;
	
	cin >> t;
	while (t--) {
		solve();
	}
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 368 KB Wrong answer

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 1540 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 1220 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -