제출 #526634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526634		nitr0gen	Red-blue table (IZhO19_stones)	C++14	17 / 100	2088 ms	332 KiB

stones

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

int ans, n, m;
char a[100][100];
bool ok;

int check() {
    int cnta = 0, cntb = 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 * 2 > m) cnta++;
    }
    for(int j = 0; j < m; j++) {
        int cnt = 0;
        for(int i = 0; i < n; i++) {
            if(a[i][j] == '-') cnt++;
        }
        if(cnt * 2 > n) cntb++;
    }
    return cnta + cntb;
}

void bkt(int i, int j) {
    if(i == n) {
        ans = max(ans, check());
    } else {
        for(auto x : {'-', '+'}) {
            a[i][j] = x;
            if(j == m-1) bkt(i+1, 0);
            else bkt(i, j+1);
        }
    }
} 

void bkt2(int i, int j) {
    if(ok) return;
    if(i == n) {
        if(check() == ans) {
            ok = 1;
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < m; j++) {
                    cout << a[i][j];
                }
                cout << '\n';
            }
        }
    } else {
        for(auto x : {'-', '+'}) {
            a[i][j] = x;
            if(j == m-1) bkt2(i+1, 0);
            else bkt2(i, j+1);
        }
    }
}

void solve() {
    cin >> n >> m;
    ans = 0;
    ok = 0;
    bkt(0, 0); 
    cout << ans << '\n';
    bkt2(0, 0);
}

int main() {
    int t;
    cin >> t;
    while(t--) solve();

    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