제출 #685341

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

stones

/**
  * Author: Tenjin
  * Created: 12.11.2022 20:39
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
char s[M][M];
void solve() {
  int n, m; read(n, m);
  /*int ans = 0;
  for(int i = 0; i < (1 << (n * m)); ++i) {
    int x = 0, y = 0;
    for(int j = 0; j < (n * m); ++j) {
      if(i & (1 << j)) {
        s[x][y] = '-';
      }
      else {
        s[x][y] = '+';
      }
      y++;
      if(y == m) x++, y = 0;
    }
    int A = 0, B = 0;
    for(int j = 0; j < n; ++j) {
      int cnt = 0;
      for(int l = 0; l < m; ++l) {
        if(s[j][l] == '+') cnt++;
        else cnt--;
      }
      if(cnt > 0) A++;
    }
    for(int j = 0; j < m; ++j) {
      int cnt = 0;
      for(int l = 0; l < n; ++l) {
        if(s[l][j] == '-') cnt++;
        else cnt--;
      }
      if(cnt > 0) B++;
    }
    ans = max(ans, A + B);
  }*/
  print(((min(n, m) - (min(n, m) % 2 == 0)) / 2 + max(n, m)));
  if(min(n, m) == n) {
    for(int i = 1; i <= (n - (n % 2 == 0)) / 2; ++i) {
      for(int j = 1; j <= m; ++j) s[i][j] = '+';
    }
    for(int i = (n - (n % 2 == 0)) / 2 + 1; i <= n; ++i) {
      for(int j = 1; j <= m; ++j) s[i][j] = '-';
    }
  }
  else {
    for(int i = 1; i <= (m - (m % 2 == 0)) / 2; ++i) {
      for(int j = 1; j <= n; ++j) s[j][i] = '-';
    }
    for(int i = (m - (m % 2 == 0)) / 2 + 1; i <= m; ++i) {
      for(int j = 1; j <= n; ++j) s[j][i] = '+';
    }
  }
  for(int i = 1; i <= n; ++i) {
    for(int j = 1; j <= m; ++j) write(s[i][j]);
    print("");
  }
/*  for(int i = 0; i < (1 << (n * m)); ++i) {
    int x = 0, y = 0;
    for(int j = 0; j < (n * m); ++j) {
      if(i & (1 << j)) {
        s[x][y] = '-';
      }
      else {
        s[x][y] = '+';
      }
      y++;
      if(y == m) x++, y = 0;
    }
    int A = 0, B = 0;
    for(int j = 0; j < n; ++j) {
      int cnt = 0;
      for(int l = 0; l < m; ++l) {
        if(s[j][l] == '+') cnt++;
        else cnt--;
      }
      if(cnt > 0) A++;
    }
    for(int j = 0; j < m; ++j) {
      int cnt = 0;
      for(int l = 0; l < n; ++l) {
        if(s[l][j] == '-') cnt++;
        else cnt--;
      }
      if(cnt > 0) B++;
    }
    if((A + B) == ans) {
      print(A, B);
      for(int j = 0; j < n; ++j) {
        for(int l = 0; l < m; ++l) write(s[j][l]);
        print("");
      }
      print("");
    }
  }*/
}

int main() {
  //freop("");
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

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

stones.cpp: In function 'void freop(std::string)':
stones.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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