Submission #156017

#	Time	Username	Problem	Language	Result	Execution time	Memory
156017		ASDF123	Red-blue table (IZhO19_stones)	C++14	0 / 100	47 ms	1316 KiB

stones

#include <bits/stdc++.h>
//#define int long long
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
using namespace std;

const int N = (int)1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = (int)1e9 + 9;

int tests = 1;

void solve() {
  int n, m, ans = 0;
  cin >> n >> m;
  char c[n + 2][m + 2];
  vector <int> col(m + 2, 0);
  vector <int> row(n + 2, 0);

  if (m > n) {
    for (int j = 1; j <= m; j++) {
      col[j] = n;
    }
    memset(c, '-', sizeof c);
    // want ++-
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (col[j] - 1 > n - (col[j] - 1)) {
          col[j]--;
          row[i]++;
          c[i][j] = '+';
        }
      }
    }
  }
  else {
    for (int i = 1; i <= n; i++) {
      row[i] = m;
    }
    memset(c, '+', sizeof c);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (row[i] - 1 > n - (row[i] - 1)) {
          col[j]++;
          row[i]--;
          c[i][j] = '-';
        }
      }
    }
  }

    for (int i = 1; i <= n; i++) {
      if (row[i] > m - row[i]) {
        ans++;
      }
    }
    for (int j = 1; j <= m; j++) {
      if (col[j] > n - col[j]) {
        ans++;
      }
    }

//    cout << "stroki\n";
//    for (int i = 1; i <= n; i++) {
//      cout << row[i] << " ";
//    }
//    cout << "\nstolbsi\n";
//    for (int i = 1; i <= m; i++) {
//      cout << col[i] << " ";
//    }cout << endl;



    printf("%d\n", ans);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cout << c[i][j];
    }puts("");
  }

}

main() {
  cin >> tests;
  while (tests--) {
    solve();
  }
}

Compilation message (stderr)

stones.cpp:85:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

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