oj.uz

Submission #331595

# Submission time Handle Problem Language Result Execution time Memory
331595 2020-11-29T04:28:31 Z bayarkhuu Red-blue table (IZhO19_stones) C++14
0 / 100
 85 ms 2352 KB 
#include <algorithm>
#include <iostream>

using namespace std;

int main() {
    int t, n, m;

    cin >> t;

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

        if (n >= m) {
            cout << n + (m - 1) / 2 << endl;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if ((m - 1) / 2 < j) {
                        cout << "- ";
                    } else {
                        cout << "+ ";
                    }
                }
                cout << endl;
            }
        } else {
            cout << m + (n - 1) / 2 << endl;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if ((n - 1) / 2 < i) {
                        cout << "+ ";
                    } else {
                        cout << "- ";
                    }
                }
                cout << endl;
            }
        }
    }

    return 0;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 364 KB Wrong answer

Subtask #3
0 / 16.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 31.0

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