oj.uz

Submission #444733

# Submission time Handle Problem Language Result Execution time Memory
444733 2021-07-15T02:29:24 Z nickyrio Red-blue table (IZhO19_stones) C++17
27 / 100
 37 ms 1252 KB 
#include <bits/stdc++.h>

using namespace std;

void Solve() {
    int n, m, ans = 0;
    cin >> n >> m;
    pair<int, int> best = {0, 0};
    for (int i = 0; i <= n; ++ i) {
        for (int j = 0; j <= m; ++j) {
            int curr = j * (i * 2 > n) + i * (j * 2 < m) + (n - i);
            if (curr > ans) {
                ans = curr;
                best = {i, j};
            }
        }
    }
    cout << ans << '\n';
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (i < best.first && j < best.second) cout << '-';
            else cout << '+';
        }
        cout << '\n';
    }
}
int main() {
  ios::sync_with_stdio(false); cin.tie(NULL);
    int test;
    cin >> test;
    while (test--) Solve();
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 2 ms 336 KB Wrong answer in test 5 29: 31 < 32

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 1252 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 37 ms 1228 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 2 ms 336 KB Wrong answer in test 5 29: 31 < 32