제출 #1338324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1338324		poapaa.	Red-blue table (IZhO19_stones)	C++20	0 / 100	13 ms	1340 KiB

stones

#include <iostream>
#include <vector>

using namespace std;

void solve() {
    int n, m, i, j;

    cin >> n >> m;
    if( n >= m ) {
        int need_plus = m / 2 + 1;
        int count_b = 0;
        for( j = 0; j < m; j++ ) {
            int pluses = 0;
            for( i = 0; i < n; i++ ) {
                if( ( i + j ) % m < need_plus ) {
                    pluses++;
                }
            }
            if( n - pluses > pluses ) {
                count_b++;
            }
        }

        cout << n + count_b << '\n';
        for( i = 0; i < n; i++ ) {
            for( j = 0; j < m; j++ ) {
                if( ( i + j ) % m < need_plus ) {
                    cout << '+';
                } else {
                    cout << '-';
                }
            }
            cout << '\n';
        }
    } else {
        int need_minus = n / 2 + 1;
        int count_a = 0;
        for( i = 0; i < n; i++ ) {
            int minuses = 0;
            for( j = 0; j < m; j++ ) {
                if( ( i + j ) % n < need_minus ) {
                    minuses++;
                }
            }
            if( m - minuses > minuses ) {
                count_a++;
            }
        }

        cout << m + count_a << '\n';
        for( i = 0; i < n; i++ ) {
            for( j = 0; j < m; j++ ) {
                if( ( i + j ) % n < need_minus ) {
                    cout << '-';
                } else {
                    cout << '+';
                }
            }
            cout << '\n';
        }
    }
}

int main() {
    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