Submission #223786

#	Time	Username	Problem	Language	Result	Execution time	Memory
223786		socho	Red-blue table (IZhO19_stones)	C++14	27 / 100	82 ms	1400 KiB

stones

#include "bits/stdc++.h"
using namespace std;
// #define endl '\n'
// #define double long double
// #define int long long
// int MOD = 1000 * 1000 * 1000 + 7;
// int MOD = 998244353;

void solve() {
	
	int n, m;
	cin >> n >> m;
	
	bool grid[n][m]; // 1 is +, 0 is -
	memset(grid, 1, sizeof grid);
	
	int best = n;
	int bX = n;
	int bA = m;
	
	for (int x=0; x<=n; x++) {
		int y = n - x;
		for (int a=0; a<=m; a++) {
			int b = m - a;
			
			int ans = 0;
			if (x > y) {
				ans += b;
			}
			else if (y > x) {
				ans += a;
			}
			if (a > b) {
				ans += x;
			}
			else if (b > a) {
				ans += y;
			}
			
			if (ans > best) {
				best = ans;
				bX = x;
				bA = a;
			}
			
		}
	}
	
	for (int i=0; i<bX; i++) {
		for (int j=bA; j<m; j++) {
			grid[i][j] = 0;
		}
	}
	for (int i=bX; i<n; i++) {
		for (int j=0; j<bA; j++) {
			grid[i][j] = 0;
		}
	}
	
	cout << best << endl;
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			if (grid[i][j]) cout << '+';
			else cout << '-';
		}
		cout << endl;
	}
	
}

signed main() {
	
	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