Submission #169415

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

stones

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

int n, m;

char a[N][N];

int q[N];
void solv()
{
    memset(q, 0, sizeof q);
    scanf("%d%d", &n, &m);
    if (n < m)
    {
        for (int i = 0; i < n; ++i)
        {
            vector<pair<int, int> > v;
            for (int j = 0; j < m; ++j)
            {
                v.push_back(m_p(q[j], j));
            }
            sort(v.begin(), v.end());
            int qq = 0;
            for (int j = 0; j < m; ++j)
            {
                if (qq * 2 <= m && (n - q[v[j].second] - 1) * 2 > n)
                {
                    ++qq;
                    a[i][v[j].second] = '+';
                    ++q[v[j].second];
                }
                else
                    a[i][v[j].second] = '-';
            }
        }
    }
    else
    {
        for (int j = 0; j < m; ++j)
        {
            vector<pair<int, int> > v;
            for (int i = 0; i < n; ++i)
            {
                v.push_back(m_p(q[i], i));
            }
            sort(v.begin(), v.end());
            int qq = 0;
            for (int i = 0; i < n; ++i)
            {
                if (qq * 2 <= n && (m - q[v[i].second] - 1) * 2 > m)
                {
                    ++qq;
                    a[v[i].second][j] = '-';
                    ++q[v[i].second];
                }
                else
                    a[v[i].second][j] = '+';
            }
        }
    }
    int ans = 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)
            ++ans;
    }
    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)
            ++ans;
    }
    printf("%d\n", ans);
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
            putchar(a[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:14: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:98: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: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31