Submission #169412

#	Time	Username	Problem	Language	Result	Execution time	Memory
169412		SamAnd	Red-blue table (IZhO19_stones)	C++17	17 / 100	2061 ms	632 KiB

stones

#include <bits/stdc++.h>
using namespace std;
const int N = 1003;

int n, m;

int ans;
char uans[N][N];

char a[N][N];

void ubd()
{
    int yans = 0;
    for (int i = 0; i < n; ++i)
    {
        int q = 0;
        for (int j = 0; j < m; ++j)
        {
            if (a[i][j] == '+')
                ++q;
        }
        if (q * 2 > m)
            ++yans;
    }
    for (int j = 0; j < m; ++j)
    {
        int q = 0;
        for (int i = 0; i < n; ++i)
        {
            if (a[i][j] == '-')
                ++q;
        }
        if (q * 2 > n)
            ++yans;
    }
    if (yans > ans)
    {
        ans = yans;
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                uans[i][j] = a[i][j];
    }
}

void rec(int i, int j)
{
    if (i == n)
    {
        ubd();
        return;
    }
    a[i][j] = '+';
    if (j == m - 1)
        rec(i + 1, 0);
    else
        rec(i, j + 1);
    a[i][j] = '-';
    if (j == m - 1)
        rec(i + 1, 0);
    else
        rec(i, j + 1);
}

void solv()
{
    scanf("%d%d", &n, &m);
    ans = 0;
    rec(0, 0);
    printf("%d\n", ans);
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
            putchar(uans[i][j]);
        putchar('\n');
    }
}

int main()
{
    int tt;
    scanf("%d", &tt);
    while (tt--)
        solv();
    return 0;
}

Compilation message (stderr)

stones.cpp: In function 'void solv()':
stones.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
stones.cpp: In function 'int main()':
stones.cpp:82:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &tt);
     ~~~~~^~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31