제출 #1306384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306384		michael12	Red-blue table (IZhO19_stones)	C++20	100 / 100	9 ms	4428 KiB

stones

#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 5e5;
void solve() {
    int n, m;
    cin >> n >> m;

    bool idx = false;
    if (n < m) {
        swap(n, m);
        idx = true;
    }

    vector<string> t(n, string(m, '+'));

    int ans = n;
    int col = 0, ct = 0;

    for (int k = 0; k < (m - 1) / 2; k++) {
        for (int p = 0; p < n; p++) {
            t[p][col] = '-';
            ct++;

            if (ct == n / 2 + 1) {
                col++;
                ct = 0;
                ans++;
            }
        }
    }

    cout << ans << '\n';

    if (!idx) {
        for (auto &p : t) {
            cout << p << '\n';
        }
    } else {
        for (int j = 0; j < m; j++) {
            for (int i = 0; i < n; i++) {
                cout << (t[i][j] == '+' ? '-' : '+');
            }
            cout << '\n';
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

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