제출 #1010580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010580		LucaIlie	Red-blue table (IZhO19_stones)	C++17	0 / 100	21 ms	1624 KiB

stones

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000;
char mat[MAX_N][MAX_N];
int sumL[MAX_N], sumC[MAX_N];

int main() {
    int t;

    cin >> t;
    for ( ; t > 0; t-- ) {
        int n, m;

        cin >> n >> m;

        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ ) {
                if ( l == n - 1 )
                    mat[l][c] = '-';
                else {
                    if ( l < n / 2 ) {
                        if ( c <= m / 2 )
                            mat[l][c] = '+';
                        else
                            mat[l][c] = '-';
                    } else {
                        if ( c < m / 2 )
                            mat[l][c] = '-';
                        else
                            mat[l][c] = '+';
                    }
                }
            }
        }

        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ ) {
                sumL[l] += (mat[l][c] == '+' ? 1 : -1);
                sumC[c] += (mat[l][c] == '+' ? -1 : +1);
            }
        }

        int r = 0;
        for ( int l = 0; l < n; l++ )
            r += (sumL[l] > 0);
        for ( int c = 0; c < m; c++ )
            r += (sumC[c] > 0);

        cout << r << "\n";

        //cout << n + m - 2 << "\n";
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                cout << mat[l][c];
            cout << "\n";
        }

    }

    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