Submission #1203986

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203986		PlayVoltz	Red-blue table (IZhO19_stones)	C++20	0 / 100	13 ms	1448 KiB

stones

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while (t--){
		int n, m;
		cin>>n>>m;
		if (n<m){
			cout<<max(m, n)+(min(m, n)-1)/2<<"\n";
			for (int i=0; i<n; ++i){
				for (int j=0; j<m; ++j){
					if (i<n/2&&j<=m/2)cout<<'+';
					else cout<<'-';
				}
				cout<<"\n";
			}
		}
		else{
			cout<<max(m, n)+(min(m, n)-1)/2<<"\n";
			for (int i=0; i<n; ++i){
				for (int j=0; j<m; ++j){
					if (i<=n/2&&j<m/2)cout<<'-';
					else cout<<'+';
				}
				cout<<"\n";
			}
		}
	}
}

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