제출 #859686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859686		Alfraganus	Red-blue table (IZhO19_stones)	C++17	100 / 100	59 ms	2328 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, '+'));
        multiset<pair<int, int>> ml;
        int l = m - (m + 2) / 2;
        for (int i = 0; i < (n * l) / ((n + 2) / 2); i++)
            ml.insert({0, i});
        for(int i = 0; i < n; i ++){
            for(int j = 0; j < l; j ++){
                pair<int, int> x = *ml.begin();
                ml.erase(ml.begin());
                a[i][x.ss] = '-';
                x.fs ++;
                ml.insert(x);
            }
        }
        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, '-'));
        multiset<pair<int, int>> ml;
        int l = n - (n + 2) / 2;
        for (int i = 0; i < (m * l) / ((m + 2) / 2); i++)
            ml.insert({0, i});
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < l; j++)
            {
                pair<int, int> x = *ml.begin();
                ml.erase(ml.begin());
                a[x.ss][i] = '+';
                x.fs++;
                ml.insert(x);
            }
        }
        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: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31