제출 #1197022

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

stones

#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

void testcase() {
   int n, m;
   cin >> n >> m;
   if(n <= 1) {
      cout << max(n, m) << '\n';
      for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cout << "-\n"[j == m];
      return;
   }
   if(m <= 1) {
      cout << max(n, m) << '\n';
      for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cout << "+\n"[j == m];
      return;
   }
   if(n <= 2) {
      cout << max(n, m) << '\n';
      for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cout << "-\n"[j == m];
      return;
   }
   if(m <= 2) {
      cout << max(n, m) << '\n';
      for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cout << "+\n"[j == m];
      return;
   }
   int ln = n - 1, lm = m - 1;
   ln -= ln % 2;
   lm -= lm % 2;
   cout << ln + lm << '\n';
   for(int i = 1; i <= n; i++) {
      for(int j = 1; j <= m; j++) {
         if(i <= ln && j <= lm)
            cout << ((i + j) % 2? '+' : '-');
         else if(i > ln) cout << '-';
         else cout << '+';
      }
      cout << '\n';
   }
}


signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int T;
   cin >> T;
   while(T--) testcase();
   
   
   
}

/**
      Binecuvanteaza Doamne Ukraina.
--
*/ 

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