# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202868 | luciocf | Red-blue table (IZhO19_stones) | C++14 | 63 ms | 1528 KiB |
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 <bits/stdc++.h>
using namespace std;
const int maxn = 1e3+10;
char tab[maxn][maxn];
int main(void)
{
int t;
scanf("%d", &t);
while (t--)
{
int n, m;
scanf("%d %d", &n, &m);
int mx = 0, ind = 1;
for (int A = 0; A <= n; A++)
{
int qtd = (m+2)/2;
int B = m-qtd;
if (n-A >= (n+2)/2) B = m;
if (A+B > mx)
mx = A+B, ind = A;
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (i <= ind && j <= (m+2)/2)
tab[i][j] = '+';
else
tab[i][j] = '-';
}
}
printf("%d\n", mx);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
printf("%c", tab[i][j]);
printf("\n");
}
}
}
Compilation message (stderr)
# | 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... |