제출 #855868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855868		Halym2007	Red-blue table (IZhO19_stones)	C++11	0 / 100	9 ms	604 KiB

stones

#include <bits/stdc++.h>
using namespace std;
vector <pair <int, int>> v;
int git, n, m, jogap;
char vis[5][5], jog[5][5];

void solve (int x) {
	if (x == git + 1) {
		int ans = 0;
		for (int i = 1; i <= n; ++i) {
			int r = 0;
			for (int j = 1; j <= m; ++j) {
				if (vis[i][j] == '+') {
					r++;
				}
				else r--;
			}
			if (r > 0) ans++; 
		}
		for (int i = 1; i <= m; ++i) {
			int b = 0;
			for (int j = 1; j <= n; ++j) {
				if (vis[j][i] == '-') b++;
				else b--;
			}
			if (b > 0) ans++;
		}
		if (jogap < ans) {
			jogap = ans;
			for (int i = 1; i <= n; ++i) {
				for (int j = 1; j <= m; ++j) {
					jog[i][j] = vis[i][j];
				}
			}
		}
		return;
	}
	for (int i = 0; i < 2; ++i) {
		char c;
		if (!i) c = '-';
		else c = '+';
		vis[v[x].first][v[x].second] = c;
		solve (x + 1); 
	}
}



int main () {
	int t;
	cin >> t;
	while ( t-- ) {
		cin >> n >> m;
		git = n * m;
		v.clear();
		v.push_back ({0, 0});
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				v.push_back ({i, j});
			}
		}
		solve (1);
		cout << jogap << "\n";
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				cout << jog[i][j];
			}
			cout << "\n";
		}
		cout << endl;
	}
}

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