Submission #878012

#	Time	Username	Problem	Language	Result	Execution time	Memory
878012		NeroZein	Red-blue table (IZhO19_stones)	C++17	15 / 100	44 ms	1484 KiB

stones

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

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while(tt--) {
    int n, m;
    cin >> n >> m;
    priority_queue<pair<int, int>> pq; 
    for (int i = 0; i < m; ++i) {
      pq.emplace(n, i); 
    }
    int ans = m; 
    vector<vector<char>> c(n, vector<char> (m, '-')); 
    int min_col = n - (n - 1) / 2; 
    for (int i = 0; i < n; ++i) {
      int need = m - ((m - 1) / 2);
      while (!pq.empty() && need) {
        auto [in_col, col] = pq.top();
        pq.pop();
        if (in_col == min_col) {
          break; 
        }
        --need; 
        in_col--;
        c[i][col] = '+'; 
        pq.emplace(in_col, col); 
      }
      ans += !need; 
    }
    cout << ans << '\n'; 
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        cout << c[i][j];
      }
      cout << '\n';
    }
  }
  return 0;
}

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