제출 #1338328

#제출 시각아이디문제언어결과실행 시간메모리
1338328poapaa.Red-blue table (IZhO19_stones)C++20
0 / 100
4 ms1352 KiB
#include <bits/stdc++.h>
using namespace std;

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

    int t;
    cin >> t;

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

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

        if (n <= m) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if (j % 2) grid[i][j] = '-';
                }
            }
        } else {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if (i % 2) grid[i][j] = '-';
                }
            }
        }

        int A = 0, B = 0;

        for (int i = 0; i < n; i++) {
            int plus = 0, minus = 0;
            for (int j = 0; j < m; j++) {
                if (grid[i][j] == '+') plus++;
                else minus++;
            }
            if (plus > minus) A++;
        }

        for (int j = 0; j < m; j++) {
            int plus = 0, minus = 0;
            for (int i = 0; i < n; i++) {
                if (grid[i][j] == '+') plus++;
                else minus++;
            }
            if (minus > plus) B++;
        }

        cout << A + B << '\n';
        for (auto &row : grid) cout << row << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...