Submission #883013

#	Time	Username	Problem	Language	Result	Execution time	Memory
883013		AI_2512	Red-blue table (IZhO19_stones)	C++17	0 / 100	26 ms	1372 KiB

stones

#include <bits/stdc++.h>

using namespace std;

int main() {
    long long t;
    cin >> t;
    for (int i = 0; i<t; i++){
        int n,m;
        cin >> n >> m;
        if (n == 0 || m == 0){
            cout << 0;
        }
        else if (n ==1){
            cout << m << "\n";
            for (int k = 0; k<m;k++){
                cout << "-";
            }
            cout << "\n";
        }
        else if(m == 1){
            cout << n << "\n";
            for (int k = 0; k < n;k++){
                cout << "+" << "\n";
            }
        }else{
            long long res = 0;
            if (n >= m){
                vector<vector<char>> matrix(n, vector<char>(m, '+'));
                res = n+m/2;
                for (int k = 1; k < m; k+=2){
                    for (int j = 0; j<n ; j++){
                        matrix[j][k] = '-';
                    }
                }
                cout << res << "\n";
                for (auto vec :matrix){
                    for (auto el:vec){
                        cout << el;
                    }
                    cout << "\n";
                }
            }
            else if (n < m){
                vector<vector<char>> matrix(n, vector<char>(m, '-'));
                res = m+n/2;
                for (int k = 1; k < n; k+=2){
                    for (int j = 0; j<m ; j++){
                        matrix[k][j] = '+';
                    }
                }
                cout << res << "\n";
                for (auto vec :matrix){
                    for (auto el:vec){
                        cout << el;
                    }
                    cout << "\n";
                }
            }
            
        }
    }
    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