Submission #1294890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294890		kawhiet	Red-blue table (IZhO19_stones)	C++20	0 / 100	5 ms	4416 KiB

stones

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

void solve() {
    int n, m;
    cin >> n >> m;
    int x = m + (n - 1) / 2;
    int y = n + (m - 1) / 2;
    vector<string> a(n, string(m, ' '));
    if (x > y) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                a[i][j] = (i % 2 == 0 ? '-' : '+');
            }
        }
    } else {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                a[i][j] = (j % 2 == 0 ? '+' : '-');
            }
        }
    }
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        int red = 0, blue = 0;
        for (int j = 0; j < m; j++) {
            if (a[i][j] == '+') {
                red++;
            } else {
                blue++;
            }
        }
        cnt += red > blue;
    }
    for (int j = 0; j < m; j++) {
        int red = 0, blue = 0;
        for (int i = 0; i < n; i++) {
            if (a[i][j] == '+') {
                red++;
            } else {
                blue++;
            }
        }
        cnt += blue > red;
    }
    assert(cnt == max(x, y));
    cout << cnt << '\n';
    for (auto s : a) {
        cout << s << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

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