제출 #888896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888896		harut_13	Red-blue table (IZhO19_stones)	C++14	27 / 100	18 ms	1372 KiB

stones

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <map>
#include <string>
#include <ios>
#include <iomanip>
#include <deque>
#include <queue>
#include <list> 
#include <stack>


#define FASTIO ios_base::sync_with_stdio(0); cin.tie(NULL);
#define CY   cout<<"YES"<<endl
#define CN   cout<<"NO"<<endl
#define ll   long long
#define ciN  cin
#define itn  int
#define pshb  push_back
#define sz  size()
#define vec vector<int>
#define vecl vector<long long>
#define fro for
#define Int int
#define stirng string
#define nedl   endl 
#define pi 3.141592653589793238463
#define endl '\n'
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>


using namespace std;



void solve() {
    int n, m; cin >> n >> m;
    if (n == m && n>5) {
        if (n &1) {
            cout << n * 2 - 2 << endl;
            for (itn i = 0; i < n/2; i++) {
                for (itn j = 0; j < n-1; j++) {
                    if (j & 1)cout << '+';
                    else cout << '-';
                    if (j == n - 2)cout << '+';
                }
                cout << endl;
            }
            fro(int i = 0; i < n; i++) {
                cout << '-';
            }
            cout << endl;
            for (itn i = 0; i < n/2; i++) {
                for (itn j = 0; j < m; j++) {
                    if (j & 1)cout << '-';
                    else cout << '+';
                }
                cout << endl;
            }
        }
        else {
            cout << (n - 2) * 2 << endl;
            for (int i = 0; i < (n - 2) / 2; i++) {
                for (itn j = 0; j < n - 2; j++) {
                    if (j & 1)cout << '+';
                    else cout << '-';
                    if (j == n - 3)cout << "++";
                }
                cout << endl;
            }
            for (itn i = 0; i < 2; i++) {
                for (itn j = 0; j < n; j++) {
                    cout << '-';
                }
                cout << endl;
            }
            for (int i = 0; i < (n - 2) / 2; i++) {
                for (itn j = 0; j < n - 2; j++) {
                    if (j & 1)cout << '-';
                    else cout << '+';
                    if (j == n - 3)cout << "++";
                }
                cout << endl;
            }
        }
        return;
    }
    if (m > n) {
        ll sum = m + (n - (n / 2 + 1));
        cout << sum << endl;
        for (int i = 0; i < (n / 2) + 1; i++) {
            for (int j = 0; j < m; j++) {
                cout << '-';
            }
            cout << endl;
        }
        for (int i = 0; i < n-(n/2+1); i++) {
            for (int j = 0; j < m; j++) {
                cout << '+';
            }
            cout << endl;
        }
    }
    else {
        ll sum = n + (m - (m / 2 + 1));
        cout << sum << endl;
         string str;
        for (int i = 0; i < (m / 2) + 1; i++) {
            str.pshb('+');
        }
        for (int i = 0; i < m - (m / 2 + 1); i++) {
            str.pshb('-');
        }
        for (itn i = 0; i < n; i++) {
            cout << str << endl;
        }
    }
}




signed main() {
    FASTIO

        int t; cin >> t;
    while (t--)
        solve();
}

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