제출 #331105

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
331105		Enkhmunkh	Red-blue table (IZhO19_stones)	C++14	0 / 100	38 ms	1512 KiB

stones

#include <bits/stdc++.h>
using namespace std;
void solution () {
    int n, m;
    cin >> n >> m;
    char arr[n][m];
    if (n > m) {
        cout << m + m/2 << "\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0, a = m/2-1; j < m; j++) {
                if (a != 0) {
                    arr[i][j] = '-';
                    a--;
                }else {
                    arr[i][j] = '+';
                }
                cout << arr[i][j];
            }
            cout << "\n";
        }
    }else {
        int a;
        if (n % 2 == 0){
            cout << m+n/2-1 << "\n";
            a = n/2-1;
        } else {
            cout << m+n/2 << "\n";
            a = n/2;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a != 0) {
                    arr[i][j] = '+';
                }else {
                    arr[i][j] = '-';
                }
                cout << arr[i][j];
            }
            if (a != 0) {
                a--;
            }
            cout << "\n";
        }
    }
}
int main () {
    ios::sync_with_stdio(false);
	cin.tie(NULL);
    int t;
    cin >> t;
    while (t--) solution();
}

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