Submission #154293

#TimeUsernameProblemLanguageResultExecution timeMemory
154293nvmdavaRed-blue table (IZhO19_stones)C++17
27 / 100
29 ms1400 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second

#define N 1200005
#define MOD 1000000007
#define INF 0x3f3f3f3f

void go(){
	int n, m;
	cin>>n>>m;
	int r1 = n + (m - 1) / 2;
	int r2 = m + (n - 1) / 2;

	if(r1 < r2){
		cout<<r2<<'\n';
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(i > (n - 1) / 2) cout<<'-';
				else cout<<'+';
			}
			cout<<'\n';
		}
	} else {
		cout<<r1<<'\n';
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(j <= (m - 1) / 2) cout<<'-';
				else cout<<'+';
			}
			cout<<'\n';
		}
	}
}

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

	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	
	int t;
	cin>>t;
	while(t--){
		go();
	}	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...