제출 #1092547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1092547		juicy	Red-blue table (IZhO19_stones)	C++17	27 / 100	23 ms	1516 KiB

stones

#include <bits/stdc++.h>
 
using namespace std;
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
 
int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);
 
  int t; cin >> t;
  while (t--) {
    int n, m; cin >> n >> m;
    bool flip = 0;
    if (n > m) {
      swap(n, m);
      flip = 1;
    }
    vector<int> cnt(m), ord(m); iota(ord.begin(), ord.end(), 0);
    int cut = (n - 1) / 2, need = m / 2 + 1;
    int x = m * cut / need;
    cout << m + x << "\n";
    vector a(n, vector<char>(m, '-'));
    for (int i = 0; i < x; ++i) {
      sort(ord.begin(), ord.end(), [&](int a, int b) {
        return cnt[a] < cnt[b];
      });
      for (int j = 0; j < need; ++j) {
        a[i][ord[j]] = '+';
      }
    }
    if (flip) {
      for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
          cout << char(a[j][i] ^ '+' ^ '-');
        }
        cout << "\n";
      }
    } else {
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
          cout << a[i][j];
        }
        cout << "\n";
      }
    }
  }
  return 0;
}

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