#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--)
{
int n, m;
cin >> n >> m;
vector<string> a(n, string(m, '+'));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
a[i][j] = ((i + j) % 2 ? '+' : '-');
for (int i = 0; i < n; ++i)
for (int j = m - 1 - (m + 1) % 2; j < m; ++j)
a[i][j] = '+';
for (int j = 0; j < m; ++j)
for (int i = n - 1 - (n + 1) % 2; i < n; ++i)
a[i][j] = '-';
int ans = 0;
for (int i = 0; i < n; ++i)
if (2 * count(a[i].begin(), a[i].end(), '+') > m)
++ans;
for (int j = 0; j < m; ++j)
{
int cnt = 0;
for (int i = 0; i < n; ++i)
if (a[i][j] == '-')
++cnt;
if (2 * cnt > n)
++ans;
}
cout << ans << '\n';
for (int i = 0; i < n; ++i)
cout << a[i] << '\n';
cout << flush;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 1: 1 < 2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
376 KB |
Wrong answer in test 2 1: 1 < 2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 1: 1 < 2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
12 ms |
1400 KB |
Wrong answer in test 87 1: 86 < 87 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
1344 KB |
Wrong answer in test 4 4: 4 < 5 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 1: 1 < 2 |