제출 #1268394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1268394		GoBananas69	Red-blue table (IZhO19_stones)	C++20	10 / 100	2 ms	328 KiB

stones

#include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<char>> grid(n, vector<char>(m));
    if (n > m) {
        if (m == 1) {
            cout << n << '\n';
            for (int i = 0; i < n; ++i) cout << "+\n";
        } else if (m == 2) {
            cout << n << '\n';
            for (int i = 0; i < n; ++i) cout << "++\n";
        } else {
            cout << n + 1 << '\n';
            for (int i = 0; i < n; ++i) cout << "+-+\n";
        }
    } else {
        if (n == 1) {
            cout << m << '\n';
            for (int i = 0; i < m; ++i) cout << "-";
            cout << '\n';
        } else if (n == 2) {
            cout << m << '\n';
            for (int i = 0; i < m; ++i) cout << "-";
            cout << '\n';
            for (int i = 0; i < m; ++i) cout << "-";
            cout << '\n';
        } else {
            cout << m + 1 << '\n';

            for (int i = 0; i < m; ++i) cout << "-";
            cout << '\n';
            for (int i = 0; i < m; ++i) cout << "+";
            cout << '\n';
            for (int i = 0; i < m; ++i) cout << "-";
            cout << '\n';
        }
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc;
    cin >> tc;
    while (tc--) {
        solve();
    }
};

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