#include <iostream>
#include <vector>
using namespace std;
int calc(vector<vector<char>>& v) {
int cnt = 0;
for (int i = 0; i < v.size(); i++) {
int c = 0;
for (int j = 0; j < v[i].size(); j++) {
if (v[i][j] == '+') c++;
}
if (c > v[i].size() / 2) cnt++;
}
for (int j = 0; j < v[0].size(); j++) {
int c = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i][j] == '-') {
c++;
}
}
if (c > v.size() / 2) cnt++;
}
return cnt;
}
void malSol(int n, int m) {
//cout << "Amerikayi miacyal nahangner\n";
/*
--------
--------
--------
++++++++
++++++++
*/
if (n + (m + 1) / 2 - 1 > m + (n + 1) / 2 - 1) {
cout << n + (m + 1) / 2 - 1 << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j <= m / 2 + 1) cout << '+';
else cout << '-';
}
cout << "\n";
}
}
else {
cout << m + (n + 1) / 2 - 1 << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i <= n / 2 + 1) cout << '-';
else cout << '+';
}
cout << "\n";
}
}
}
int malSol1(int n, int m) {
bool f = 0;
if (n + (m + 1) / 2 < m + (n + 1) / 2) {
f = 1;
swap(n, m);
}
vector<vector<char>> vec(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m / 2; j++) vec[i].push_back('+');
for (int j = 0; j < cnt; j++) vec[i].push_back('-');
vec[i].push_back('+');
for (int j = 0; j < (m + 1) / 2 - 1 - cnt; j++) vec[i].push_back('-');
cnt++;
if (cnt == m - m / 2) cnt = 0;
}
int res = calc(vec);
return max(res, max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1));
}
void printmalSol(int n, int m, bool flanfstan) {
bool f = 0;
if (n + (m + 1) / 2 < m + (n + 1) / 2) {
f = 1;
swap(n, m);
}
if (n == 7 && flanfstan) n = 6;
else if (flanfstan) m = 6;
vector<vector<char>> vec(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m / 2; j++) vec[i].push_back('+');
for (int j = 0; j < cnt; j++) vec[i].push_back('-');
vec[i].push_back('+');
for (int j = 0; j < (m + 1) / 2 - 1 - cnt; j++) vec[i].push_back('-');
cnt++;
if (cnt == m - m / 2) cnt = 0;
}
int res = calc(vec);
if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > res && !flanfstan) {
if (f) swap(n, m);
malSol(n, m);
return;
}
cout << flanfstan + res << endl;
if (!f) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << vec[i][j];
}
if(m == 6 && flanfstan) cout << '-';
cout << endl;
}
if (n == 6 && flanfstan) for (int i = 0; i < m; i++) cout << '+';
return;
}
for (int j = 0; j < m; j++) {
for (int i = 0; i < n; i++) {
if (vec[i][j] == '+') cout << '-';
else cout << '+';
}
if (m == 6 && flanfstan) cout << '-';
cout << endl;
}
if (n == 6 && flanfstan) for (int i = 0; i < m; i++) cout << '+';
}
void solve() {
int n, m; cin >> n >> m;
if (n == 6 || m == 6) {
printmalSol(n, m, 0);
return;
}
if (n == 7 && m % 2 == 0) {
printmalSol(n, m, 1);
return;
}
if (m == 7 && n % 2 == 0) {
printmalSol(n, m, 1);
return;
}
if (min(m, n) <= 3 || (n <= 4 && m <= 4)) {
malSol(n, m);
return;
}
else if (n % 2 == 0 && m % 2 == 0 && min(m, n) > 5) {
cout << n + m - 4 << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
for (int i = 2; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
for (int j = m / 2 + 1; j < m; j++) cout << "-";
cout << "\n";
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << "-";
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
cout << "\n";
}
}
}
else if (n % 2 == 0 && m % 2 && min(m, n) > 5) {
cout << n + m - 4 << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
m--;
for (int i = 2; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
for (int j = m / 2 + 1; j < m; j++) cout << "-";
// cout << "\n";
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << "-";
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
// cout << "\n";
}
cout << "-\n";
}
return;
}
else if (n % 2 && m % 2 == 0 && min(m, n) > 5) {
cout << n + m - 4 << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
for (int i = 2; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
for (int j = m / 2 + 1; j < m; j++) cout << "-";
cout << "\n";
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << "-";
for (int j = 0; j < m / 2 + 1; j++) cout << "+";
cout << "\n";
}
}
for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
return;
}
else {
if (n % 2) {
if (malSol1(n, m) > n + m - 2 - (1 - (m % 2))) {
printmalSol(n, m, 0);
return;
}
cout << n + m - 2 - (1 - (m % 2)) << endl;
}
else {
// return;
if (malSol1(n, m) > m - 1 - (1 - (m % 2)) + n - 2) {
printmalSol(n, m, 0);
return;
}
cout << m - 1 - (1 - (m % 2)) + n - 2 << endl;
}
vector<vector<char>> vec(n);
for (int i = 0; i < m; i++) vec[0].push_back('-');
if (n % 2 == 0) for (int i = 0; i < m; i++) vec[1].push_back('-');
for (int i = 1 + (1 - (n % 2)); i < n; i++) {
if (i % 2) {
for (int j = 1; j <= m / 2 + 1; j++) vec[i].push_back('+');
for (int j = m / 2 + 2; j <= m; j++) vec[i].push_back('-');
}
else {
for (int j = m / 2 + 2; j <= m; j++) vec[i].push_back('-');
for (int j = 1; j <= m / 2 + 1; j++) vec[i].push_back('+');
}
}
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[i].size(); j++) {
cout << vec[i][j];
}
cout << endl;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int t; cin >> t; while (t--)
solve();
}
Compilation message
stones.cpp: In function 'int calc(std::vector<std::vector<char> >&)':
stones.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | for (int i = 0; i < v.size(); i++) {
| ~~^~~~~~~~~~
stones.cpp:10:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
10 | for (int j = 0; j < v[i].size(); j++) {
| ~~^~~~~~~~~~~~~
stones.cpp:13:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
13 | if (c > v[i].size() / 2) cnt++;
| ~~^~~~~~~~~~~~~~~~~
stones.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
15 | for (int j = 0; j < v[0].size(); j++) {
| ~~^~~~~~~~~~~~~
stones.cpp:17:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | for (int i = 0; i < v.size(); i++) {
| ~~^~~~~~~~~~
stones.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | if (c > v.size() / 2) cnt++;
| ~~^~~~~~~~~~~~~~
stones.cpp: In function 'int malSol1(int, int)':
stones.cpp:60:10: warning: variable 'f' set but not used [-Wunused-but-set-variable]
60 | bool f = 0;
| ^
stones.cpp: In function 'void solve()':
stones.cpp:146:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
146 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:146:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
146 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:147:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
147 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:147:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
147 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:163:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
163 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:163:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
163 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:164:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
164 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:164:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
164 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:183:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
183 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:183:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
183 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:184:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
184 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~
stones.cpp:184:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
184 | for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
| ^~~~
stones.cpp:197:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
197 | for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
| ^~~
stones.cpp:197:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
197 | for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
| ^~~~
stones.cpp:229:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
229 | for (int i = 0; i < vec.size(); i++) {
| ~~^~~~~~~~~~~~
stones.cpp:230:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
230 | for (int j = 0; j < vec[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
280 KB |
Wrong answer |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
280 KB |
Wrong answer |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
67 ms |
1264 KB |
Output is correct |
| 2 |
Correct |
35 ms |
1740 KB |
Output is correct |
| 3 |
Correct |
35 ms |
2224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
1364 KB |
Output is correct |
| 2 |
Correct |
27 ms |
1664 KB |
Output is correct |
| 3 |
Correct |
26 ms |
1428 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
280 KB |
Wrong answer |
| 4 |
Halted |
0 ms |
0 KB |
- |
