Submission #859636

#	Time	Username	Problem	Language	Result	Execution time	Memory
859636		Alfraganus	Red-blue table (IZhO19_stones)	C++17	27 / 100	30 ms	1364 KiB

stones

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second

#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

void solve()
{
    int n, m;
    cin >> n >> m;
    if (n <= m)
    {
        vector<vector<char>> a(n, vector<char>(m, '+'));
        for (int i = 0; i < (n + 2) / 2; i++)
        {
            for (int j = 0; j < m; j++)
            {
                a[i][j] = '-';
            }
        }
        int ans = 0;
        for (int i = 0; i < n; i++)
        {
            int cnt = 0;
            for (int j = 0; j < m; j++)
            {
                if (a[i][j] == '+')
                {
                    cnt++;
                }
            }
            if (cnt > m - cnt)
            {
                ans++;
            }
        }
        for (int i = 0; i < m; i++)
        {
            int cnt = 0;
            for (int j = 0; j < n; j++)
            {
                if (a[j][i] == '-')
                {
                    cnt++;
                }
            }
            if (cnt > n - cnt)
            {
                ans++;
            }
        }
        cout << ans << endl;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cout << a[i][j];
            }
            cout << endl;
        }
    }
    else
    {
        vector<vector<char>> a(n, vector<char>(m, '-'));
        for(int i = 0; i < n; i ++){
            for(int j = 0; j < (m + 2) / 2; j ++){
                a[i][j] = '+';
            }
        }
        int ans = 0;
        for (int i = 0; i < n; i++)
        {
            int cnt = 0;
            for (int j = 0; j < m; j++)
            {
                if (a[i][j] == '+')
                {
                    cnt++;
                }
            }
            if (cnt > m - cnt)
            {
                ans++;
            }
        }
        for (int i = 0; i < m; i++)
        {
            int cnt = 0;
            for (int j = 0; j < n; j++)
            {
                if (a[j][i] == '-')
                {
                    cnt++;
                }
            }
            if (cnt > n - cnt)
            {
                ans++;
            }
        }
        cout << ans << endl;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cout << a[i][j];
            }
            cout << endl;
        }
    }
}

signed main()
{
    // fastio
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
        cout << endl;
    }
}

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