Submission #173758

#	Time	Username	Problem	Language	Result	Execution time	Memory
173758		emil_physmath	Red-blue table (IZhO19_stones)	C++17	0 / 100	12 ms	1400 KiB

stones

#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        vector<string> a(n, string(m, '+'));
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                a[i][j] = ((i + j) % 2 ? '+' : '-');
        for (int i = 0; i < n; ++i)
            for (int j = m - 1 - (m + 1) % 2; j < m; ++j)
                a[i][j] = '+';
        for (int j = 0; j < m; ++j)
            for (int i = n - 1 - (n + 1) % 2; i < n; ++i)
                a[i][j] = '-';
        int ans = 0;
        for (int i = 0; i < n; ++i)
            if (2 * count(a[i].begin(), a[i].end(), '+') > m)
                ++ans;
        for (int j = 0; j < m; ++j)
        {
            int cnt = 0;
            for (int i = 0; i < n; ++i)
                if (a[i][j] == '-')
                    ++cnt;
            if (2 * cnt > n)
                ++ans;
        }
        cout << ans << '\n';
        for (int i = 0; i < n; ++i)
            cout << a[i] << '\n';
        cout << flush;
    }
}

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