Submission #670507

#	Time	Username	Problem	Language	Result	Execution time	Memory
670507		GudStonks	Red-blue table (IZhO19_stones)	C++17	100 / 100	31 ms	2252 KiB

stones

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

char arr[1005][1005];

void fun(){
	bool boo = 0;
	ll n, m;
	cin>>n>>m;
	
	if(n > m)swap(n, m), boo = 1;
	
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)
			arr[i][j] = (boo ? '+' : '-');
	
	cout<<max(n, m) + min(min(n, m), (min(n, m) / 2 - !(min(n, m) & 1)) * max(n, m) / (max(n, m) / 2 + 1))<<endl;
	
	for(int i = 1, last = 1; i <= min(min(n, m), (min(n, m) / 2 - !(min(n, m) & 1)) * max(n, m) / (max(n, m) / 2 + 1)); i++){
		for(int j = 1; j <= m / 2 + 1; j++, last++){
			if(last == m + 1)last = 1;
			arr[i][last] = (boo ? '-' : '+');
		}
	}
	
	if(!boo){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++)
				cout<<arr[i][j];
			cout<<"\n";
		}
	}
	else{
		for(int i = 1; i <= m; i++){
			for(int j = 1; j <= n; j++)
				cout<<arr[j][i];
			cout<<"\n";
		}
	}
	cout<<"\n";
}

int main(){
	int ttt = 1;
	cin>>ttt;
	while(ttt--)fun();
}

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