Submission #598987

#	Time	Username	Problem	Language	Result	Execution time	Memory
598987		Jomnoi	Red-blue table (IZhO19_stones)	C++17	17 / 100	24 ms	1364 KiB

stones

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

const int MAX_N = 1005;

int a[MAX_N][MAX_N], b[MAX_N][MAX_N];

void solve(int N, int M) {
    int ans = 0;
    if(N <= 4 and M <= 4) {
        for(int mask = 0; mask < (1<<(N * M)); mask++) {
            int sum = 0;
            for(int i = 0; i < N; i++) {
                for(int j = 0; j < M; j++) {
                    if(mask & (1<<(i * M + j))) {
                        a[i][j] = 1;
                    }
                    else {
                        a[i][j] = 0;
                    }
                }
            }

            for(int i = 0; i < N; i++) {
                int cnt1 = 0;
                for(int j = 0; j < M; j++) {
                    cnt1 += a[i][j];
                }

                sum += (cnt1 > M - cnt1);
            }
            for(int j = 0; j < M; j++) {
                int cnt1 = 0;
                for(int i = 0; i < N; i++) {
                    cnt1 += a[i][j];
                }

                sum += (N - cnt1 > cnt1);
            }

            if(ans < sum) {
                ans = sum;
                for(int i = 0; i < N; i++) {
                    for(int j = 0; j < M; j++) {
                        b[i][j] = a[i][j];
                    }
                }
            }
        }
    }
    else {
        // do nothing
    }

    cout << ans << '\n';
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            if(b[i][j] == 1) {
                cout << '+';
            }
            else {
                cout << '-';
            }
        }
        cout << '\n';
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int T;
    cin >> T;
    
    while(T--) {
        int N, M;
        cin >> N >> M;

        solve(N, M);
    }
    return 0;
}

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