This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
char ans[1001][1002];
void solve() {
int n, m;
cin >> n >> m;
int aA = 0, aB = 0;
if (n < m) aB = m;
else aA = n;
for (int A = 0; A <= n; ++A) {
for (int B = 0; B <= m; ++B) {
if (A + B <= aA + aB) continue;
if ((n >> 1) < (A * max(B - (m >> 1), 0) + B - 1) / B) continue;
aA = A;
aB = B;
}
}
printf("%d\n", aA + aB);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (j > aB) ans[i][j] = '+';
else ans[i][j] = '-';
}
ans[i][m + 1] = 0;
}
const int C = max(aB - (m >> 1), 0);
for (int i = 1, j = 1; i <= aA; ++i) {
for (int k = 0; k < C; ++k) {
ans[i][j] = '+';
j = j % m + 1;
}
}
for (int i = 1; i <= n; ++i) printf("%s\n", ans[i] + 1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |