oj.uz

Submission #883281

# Submission time Handle Problem Language Result Execution time Memory
883281 2023-12-05T04:03:50 Z AI_2512 Red-blue table (IZhO19_stones) C++17
0 / 100
 24 ms 1464 KB 
#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 if(m == 2){
            cout << n << "\n";
            for (int k = 0; k < n;k++){
                cout << "+" << "\n";
            }
            for (int k = 0; k < n;k++){
                cout << "+" << "\n";
            }
        }
        else if(n == 2){
            cout << m << "\n";
            for (int k = 0; k < m;k++){
                cout << "-";
            }
            cout << "\n";
            for (int k = 0; k < m;k++){
                cout << "-";
            }
        }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.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1464 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 1260 KB in the table A+B is not equal to 36
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer
3 Halted 0 ms 0 KB -