oj.uz

Submission #990395

# Submission time Handle Problem Language Result Execution time Memory
990395 2024-05-30T11:03:26 Z tch1cherin Red-blue table (IZhO19_stones) C++17
26 / 100
 17 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int T;
  cin >> T;
  while (T--) {
    int N, M;
    cin >> N >> M;
    int H = N - 2 + N % 2, W = M - 2 + M % 2;
    if (H + W < N) {
      cout << N << "\n";
      for (int i = 0; i < N; i++) {
        cout << string(M, '+') << "\n";
      }
    } else if (H + W < M) {
      cout << M << "\n";
      for (int i = 0; i < N; i++) {
        cout << string(M, '-') << "\n";
      }
    } else if (N == 4 && M == 3) {
      cout << "5\n+-+\n+-+\n+-+\n+-+\n";
    } else if (N == 4 && M == 4) {
      cout << "5\n+++-\n+++-\n+++-\n+++-\n";
    } else if (N == 6 && M == 6) {
      cout << "9\n++++--\n+++-+-\n+++--+\n++++--\n+++-+-\n+++--+\n";
    } else {
      cout << H + W << "\n";
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
          if (i < H && j < W) {
            cout << "+-"[(i + j) % 2];
          } else if (i < H) {
            cout << "+";
          } else {
            cout << "-";
          }
        }
        cout << "\n";
      }
    }
  }
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 3 4: 4 < 5
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 in test 3 6: 6 < 7
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 3 4: 4 < 5
3 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1372 KB Output is correct
2 Correct 14 ms 1116 KB Output is correct
3 Correct 14 ms 1112 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1372 KB Output is correct
2 Correct 13 ms 1116 KB Output is correct
3 Correct 12 ms 1116 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 3 4: 4 < 5
3 Halted 0 ms 0 KB -