제출 #334353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334353		limabeans	Red-blue table (IZhO19_stones)	C++17	0 / 100	4 ms	1388 KiB

stones

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;



void solve() {
    int n,m;
    cin>>n>>m;
    int op1 = n+(m+1)/2-1;
    int op2 = (n+1)/2-1+m;
    if (op1>op2) {
	cout<<op1<<"\n";
	string s;
	while (int(s.length()+s.length()) <= m) {
	    s += '+';
	}
	while ((int)s.length()<m) s += '-';
	for (int i=0; i<n; i++) {
	    cout<<s<<"\n";
	}
    } else {
	cout<<op2<<"\n";
	int rows = 0;
	for (int i=0; i<n; i++) {
	    if (rows+rows>n) {
		cout<<string(m,'-')<<"\n";
	    } else {
		cout<<string(m,'+')<<"\n";
		rows++;
	    }
	}
    }
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    int t;
    cin>>t;
    while (t--) solve();
    
    
    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