Submission #146156

#	Time	Username	Problem	Language	Result	Execution time	Memory
146156		imeimi2000	Red-blue table (IZhO19_stones)	C++17	0 / 100	15 ms	1528 KiB

stones

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

char ans[1001][1002];
void solve() {
    int n, m;
    cin >> n >> m;
    int aA = 0, aB = 0;
    if (n < m) aB = m;
    else aA = n;
    for (int A = 0; A <= n; ++A) {
        for (int B = 0; B <= m; ++B) {
            if (A + B <= aA + aB) continue;
            if ((n >> 1) < (A * max(B - (m >> 1), 0) + B - 1) / B) continue;
            aA = A;
            aB = B;
        }
    }
    printf("%d\n", aA + aB);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (j > aB) ans[i][j] = '+';
            else ans[i][j] = '-';
        }
        ans[i][m + 1] = 0;
    }
    const int C = max(aB - (m >> 1), 0);
    for (int i = 1, j = 1; i <= aA; ++i) {
        for (int k = 0; k < C; ++k) {
            ans[i][j] = '+';
            j = j % m + 1;
        }
    }
    for (int i = 1; i <= n; ++i) printf("%s\n", ans[i] + 1);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    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