제출 #1127890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1127890		masteromar27	Red-blue table (IZhO19_stones)	C++20	0 / 100	71 ms	1348 KiB

stones

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int T;
    cin >> T;
    
    while (T--) {
        int N, M;
        cin >> N >> M;

        vector<vector<char>> table(N, vector<char>(M));

        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                if ((i + j) % 2 == 0) {
                    table[i][j] = '+';
                } else {
                    table[i][j] = '-';
                }
            }
        }

        int A = 0, B = 0;
        
        for (int i = 0; i < N; i++) {
            int redCount = 0, blueCount = 0;
            for (int j = 0; j < M; j++) {
                if (table[i][j] == '+') redCount++;
                else blueCount++;
            }
            if (redCount > blueCount) A++;
        }

        for (int j = 0; j < M; j++) {
            int redCount = 0, blueCount = 0;
            for (int i = 0; i < N; i++) {
                if (table[i][j] == '+') redCount++;
                else blueCount++;
            }
            if (blueCount > redCount) B++;
        }

        cout << A + B << endl;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                cout << table[i][j];
            }
            cout << endl;
        }
    }

    return 0;
}

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