Submission #880401

#	Time	Username	Problem	Language	Result	Execution time	Memory
880401		dubabuba	Red-blue table (IZhO19_stones)	C++14	17 / 100	2057 ms	2652 KiB

stones

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

const int mxn = 1010;
int a[mxn][mxn], n, m;

void go() {
	cin >> n >> m;
	int s = n * m;

	int ans = 0, seed = 0;
	for(int bit = 0; bit < (1 << s); bit++) {
		for(int k = 0; k < s; k++) {
			int i = k / m;
			int j = k % m;
			if(bit & (1 << k))
				a[i][j] = 1;
			else
				a[i][j] = 0;
		}

		int sum = 0;
		for(int i = 0; i < n; i++) {
			int r = 0, b = 0;
			for(int j = 0; j < m; j++)
				if(a[i][j]) r++;
				else b++;
			if(r > b) sum++;
		}

		for(int j = 0; j < m; j++) {
			int r = 0, b = 0;
			for(int i = 0; i < n; i++)
				if(a[i][j]) r++;
				else b++;
			if(b > r) sum++;
		}

		if(ans < sum) {
			ans = sum;
			seed = bit;
		}
	}

	cout << ans << '\n';
	for(int k = 0; k < s; k++) {
		int i = k / m;
		int j = k % m;
		if(seed & (1 << k))
			a[i][j] = 1;
		else
			a[i][j] = 0;
	}

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++)
			if(a[i][j]) cout << '+';
			else cout << '-';
		cout << '\n';
	}
}

int main() {
	int T;
	cin >> T;
	while(T--)
		go();
	return 0;
}

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