Submission #333995

#	Time	Username	Problem	Language	Result	Execution time	Memory
333995		boykut	Red-blue table (IZhO19_stones)	C++14	0 / 100	35 ms	1352 KiB

stones

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    char a[n][n];
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        a[i][j] = '+';
    if (n == 1) {
      for (int j = 0; j < m; j++) {
        a[0][j] = '-';
      }
    } else if (m == 1) {
      for (int i = 0; i < n; i++) {
        a[i][0] = '-';
      }
    } else if (n == 2) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          if (j & 1) a[i][j] = '-';
    } else if (m == 2) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          if (i & 1) a[i][j] = '-';
    } else if (m & 1) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++)
          if (j & 1) a[i][j] = '-';
      }
    } else if (n & 1) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          if (i & 1) a[i][j] = '-';
    }
    int A = 0, B = 0;
    for (int i = 0; i < n; i++) {
      int cnt = 0;
      for (int j = 0; j < m; j++) {
        if (a[i][j] == '+') cnt++;
      }
      if (cnt > m / 2) A++;
    }
    for (int j = 0; j < m; j++) {
      int cnt = 0;
      for (int i = 0; i < n; i++) {
        if (a[i][j] == '-') cnt++;
      }
      if (cnt > n / 2)B++;
    }
    cout << A + B << '\n';
    
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++)
        cout << a[i][j];
      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