제출 #1102140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102140		rembocoder	Red-blue table (IZhO19_stones)	C++17	100 / 100	8 ms	3368 KiB

stones

#include <bits/stdc++.h>

using namespace std;

#define int int64_t

const int mod = 1e9 + 7;
const int inf = 2e18;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int ttt;
    cin >> ttt;
    while (ttt--) {
        int n, m;
        cin >> n >> m;
        bool inv = false;
        if (n > m) {
            inv = true;
            swap(n, m);
        }
        vector<string> a(n, string(m, '-'));
        int plus_in_col = (n - 1) / 2;
        int pos_rows = (plus_in_col * m) / (m / 2 + 1);
        int i = 0;
        for (int j = 0; j < m; j++) {
            for (int q = 0; q < plus_in_col; q++) {
                a[i][j] = '+';
                i = (i + 1) % pos_rows;
            }
        }
        cout << pos_rows + m << '\n';
        if (inv) {
            swap(n, m);
            vector<string> b(n, string(m, '-'));
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    b[i][j] = a[j][i] == '-' ? '+' : '-';
                }
            }
            a = b;
        }
        for (int i = 0; i < n; i++) {
            cout << a[i] << '\n';
        }
    }
}

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