제출 #1131947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131947		JelalTkm	Red-blue table (IZhO19_stones)	C++20	0 / 100	16 ms	1740 KiB

stones

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

#define int long long int

const int N = 3e5 + 10;
const int md = 1e9 + 7;
const int INF = 1e9;

int32_t main(int32_t argc, char *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int T = 1;
  cin >> T;
  while (T--) {
    int n, m;
    cin >> n >> m;
    if (n < m) {
      vector<vector<int>> a(n + 1, vector<int> (m + 1));
      for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
          a[i][j] = 0;

      vector<int> st(n + 1);

      for (int j = 1; j <= m; j++) {
        int cnt = 0;
        for (int i = 1; i <= n && (cnt + 1) <= (n - (cnt + 1)) && st[i] <= (m - st[i]); i++) {
          a[i][j] = 1;
          cnt++;
          st[i]++;
        }
      }

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

      ans += m;

      cout << ans << '\n';
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)
          cout << (a[i][j] == 1 ? '+' : '-');
        cout << '\n';
      }
    } else {
      vector<vector<int>> a(n + 1, vector<int> (m + 1));
      for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
          a[i][j] = 1;

      vector<int> st(m + 1);

      for (int i = 1; i <= n; i++) {
        int cnt = 0;
        for (int j = 1; j <= m && (cnt + 1) <= (m - (cnt + 1)) && st[j] <= (n - st[j]); j++) {
          a[i][j] = 0;
          cnt++;
          st[j]++;
        }
      }

      int ans = n;
      for (int j = 1; j <= m; j++) {
        int cnt = 0;
        for (int i = 1; i <= n; i++) {
          cnt += !(a[i][j]);
        }
        if (cnt > (n - cnt))
          ans++;
      }

      cout << ans << '\n';
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)
          cout << (a[i][j] == 1 ? '+' : '-');
        cout << '\n';
      }
    }
  }

  return 0;
}

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