Submission #599009

#	Time	Username	Problem	Language	Result	Execution time	Memory
599009		Plurm	Red-blue table (IZhO19_stones)	C++11	27 / 100	7 ms	1476 KiB

stones

#include <bits/stdc++.h>
using namespace std;

char table[1024][1024];
void build(int n, int m) {
  // n >= m for sure
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      table[i][j] = j < (m - 1) / 2 ? '-' : '+';
    }
    table[i][m] = '\0';
  }
}
char tmp[1024][1024];
void transpose(int n, int m) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      tmp[j][i] = '+' ^ '-' ^ table[i][j];
    }
  }
  for (int j = 0; j < m; j++)
    tmp[j][n] = '\0';
  for (int i = 0; i < m; i++) {
    strcpy(table[i], tmp[i]);
  }
}
int count(int n, int m) {
  int cc = 0;
  for (int i = 0; i < n; i++) {
    int uc = 0;
    for (int j = 0; j < m; j++) {
      if (table[i][j] == '+')
        uc++;
    }
    if (uc > m - uc)
      cc++;
  }
  for (int j = 0; j < m; j++) {
    int uc = 0;
    for (int i = 0; i < n; i++) {
      if (table[i][j] == '-')
        uc++;
    }
    if (uc > n - uc)
      cc++;
  }
  return cc;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d%d", &n, &m);
    if (n < m) {
      build(m, n);
      transpose(m, n);
    } else {
      build(n, m);
    }
    printf("%d\n", count(n, m));
    for (int i = 0; i < n; i++) {
      printf("%s\n", table[i]);
    }
  }
  return 0;
}

Compilation message (stderr)

stones.cpp: In function 'int main()':
stones.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf("%d", &t);
      |   ~~~~~^~~~~~~~~~
stones.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31