제출 #280720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
280720		milleniumEeee	Red-blue table (IZhO19_stones)	C++14	100 / 100	29 ms	2296 KiB

stones

#include <bits/stdc++.h>
//#define int long long
#define pii pair<int, int>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
#define Ok puts("Ok")
using namespace std;
  
const int N = (int)1e3 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = (int)1e9 + 9;
  
int tests = 1;
int n, m, ans;
char a[N][N], c[N][N];
vector <pair<int, int>> row, col;
  
void init() {
  row.clear();
  col.clear();
  ans = 0;
}
  
inline void solve() {
  init();
  cin >> n >> m;
  
  if (m >= n) {
    ans = m;
    int can = n - (n / 2 + 1);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        c[i][j] = '-';
      }
    }
  
    for (int j = 1; j <= m; j++) {
      col.push_back({j, can});
    }
  
    int need = m / 2 + 1;
    for (int i = 1; i <= n; i++) {
      if (col.empty() || col.size() < need) {
        break;
      }
      int cnt = 0;
      sort (all(col), [&](pii A, pii B) {
          return A.sc > B.sc;
        });
      for (int j = 0; j < need; j++) {
        if (col[j].sc) {
          cnt++;
        }
      }
      if (cnt == need) {
        ans++;
        for (int j = 0; j < need; j++) {
          c[i][col[j].fr] = '+';
          col[j].sc--;
        }
      } else {
        break;
      }
  
      while (!col.empty() && col.back().sc == 0) {
        col.pop_back();
      }
    }
  }
  else {
    ans = n;
    int can = m - (m / 2 + 1);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        c[i][j] = '+';
      }
    }
  
    for (int i = 1; i <= n; i++) {
      row.push_back({i, can});
    }
  
    int need = n / 2 + 1;
    for (int j = 1; j <= m; j++) {
      if (row.empty() || row.size() < need) {
        break;
      }
  
      int cnt = 0;
      sort (all(row), [&](pii A, pii B) {
        return A.sc > B.sc;
      });
      for (int i = 0; i < need; i++) {
        if (row[i].sc) {
          cnt++;
        }
      }
      if (cnt == need) {
        ans++;
        for (int i = 0; i < need; i++) {
          c[row[i].fr][j] = '-';
          row[i].sc--;
        }
      } else {
        break;
      }
  
      while (!row.empty() && row.back().sc == 0) {
        row.pop_back();
      }
    }
  }
  
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      putchar(c[i][j]);
    }printf("\n");
  }
}
  
main() {
  cin >> tests;
  while (tests--) {
    solve();
  }
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'void solve()':
stones.cpp:45:37: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |       if (col.empty() || col.size() < need) {
      |                          ~~~~~~~~~~~^~~~~~
stones.cpp:87:37: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |       if (row.empty() || row.size() < need) {
      |                          ~~~~~~~~~~~^~~~~~
stones.cpp: At global scope:
stones.cpp:124:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  124 | main() {
      |      ^

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